An Approach for Text Steganography Based on Markov Chains
This work addresses the need for improved text steganography techniques for secure communication, but it appears incremental as it builds on existing Markov-based methods.
The paper tackles the problem of generating unnatural and detectable steganographic texts by introducing a method that better approximates the original language model, resulting in more natural-looking and less detectable hidden information.
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.