An Approach for Text Steganography Based on Markov Chains
Not on the map. Why?
Abstract (arXiv)
A text steganography method based on Markov chains is introduced, together with a reference implementation. This method allows for information hiding in texts that are automatically generated following a given Markov model. Other Markov - based systems of this kind rely on big simplifications of the language model to work, which produces less natural looking and more easily detectable texts. The method described here is designed to generate texts within a good approximation of the original language model provided.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Sep 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 2.
4 papers.
- 2021Provably Secure Generative Linguistic Steganographycited by 34
- 2024OD-Stega: LLM-Based Relatively Secure Steganography via Optimized Distributionscited by 5
- 2024Zero-shot Generative Linguistic Steganographycited by 4
- 2022A Survey On Semantic Steganography Systemscited by 0
- 2024OD-Stega: LLM-Based Relatively Secure Steganography via Optimized Distributions6 Oct 2024
- 2024Zero-shot Generative Linguistic Steganography16 Mar 2024
- 2022A Survey On Semantic Steganography Systems3 Feb 2022
- 2021Provably Secure Generative Linguistic Steganography3 Jun 2021