A new paradigm hidden in steganography
Proceedings of the 2000 workshop on New security paradigms
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Toward a theory of steganography
Toward a theory of steganography
On steganographic chosen covertext security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Public-key steganography with active attacks
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Upper and lower bounds on black-box steganography
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On the limits of steganography
IEEE Journal on Selected Areas in Communications
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Provably secure steganography and the complexity of sampling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Theoretical Computer Science
| Hi-index | 0.00 |
The goal of steganography is to pass secret messages by disguising them as innocent-looking covertexts. Real world stegosystems are often broken because they make invalid assumptions about the system's ability to sample covertexts. We examine whether it is possible to weaken this assumption. By modeling the covertext distribution as a stateful Markov process, we create a sliding scale between real world and provably secure stegosystems. We also show that insufficient knowledge of past states can have catastrophic results.