Elamur Research⌕
☰
home / authors / Ruiyi Yan

Ruiyi Yan

Ruiyi Yan has 2 papers in our library, in 2026; often with Yugo Murawaki.

2 papers in our library · 2026

OpenAlex · ORCID · h-index 2 · 19 works · 26 citations OpenAlex, 2026-10-14

📄 2 works in our library · ⭐ Paper Stars ranking: #13106

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: Google Scholar · Semantic Scholar · dblp · ACL Anthology

 Affiliations

🎓Kyoto UniversityKyoto · Japan2025–2026 · 11 paperscurrent🎓Beijing University of Posts and TelecommunicationsBeijing · China2026 · 1 papercurrent🎓Beijing Institute of TechnologyBeijing · China2023–2024 · 4 papers

From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine.

 Fields, topics and concepts

Of its works in our library, with the number of works on each.

📚 Shelves 7The field of science this work belongs to (OpenAlex fields).Computer Science · 2 worksEngineering · 1 workArtificial Intelligence · 2 worksComputer Vision and Pattern Recognition · 2 worksElectrical and Electronic Engineering · 1 workArts and Humanities · 1 workLanguage and Linguistics · 1 work

 Works by year

2020s

20262 papers

 Papers

The most cited first (OpenAlex and our library).

  1. Efficient Provably Secure Linguistic Steganography via Range Coding (2026 · 1 citation)
    Linguistic steganography hides secret messages inside ordinary-looking generated text. Provably secure schemes keep the language model's output distribution unchanged (zero KL divergence), but they usually give up embedding capacity or speed. The authors, Yan and Murawaki of Kyoto University, return to range coding…
  2. Anchored Sliding Window: Toward Robust and Imperceptible Linguistic Steganography (2026)
    LLM-based linguistic steganography usually assumes the stegotext reaches the receiver unchanged. Because extraction repeats autoregressive inference, altering one token corrupts decoding of everything after it. The earlier robust method, WinStega, conditions only on the most recent tokens. This makes it robust, but…

 Co-authors here

1 co-author with a page, the most papers together first.

Venues

Where their works here were published, the most works first, with the editions of those that have a page.

Updated

This page in Markdown → https://md.research.elamur.ai/free/en/authors/ruiyi-yan/