Paper 2005/305
Steganography with Imperfect Samplers
Anna Lysyanskaya and Maria Meyerovich
Abstract
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.
Note: Updated paper for clarity; revised introduction.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Steganographyinformation hidinganonymity
- Contact author(s)
- mira @ cs brown edu
- History
- 2005-12-07: revised
- 2005-09-07: received
- See all versions
- Short URL
- https://ia.cr/2005/305
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/305,
author = {Anna Lysyanskaya and Maria Meyerovich},
title = {Steganography with Imperfect Samplers},
howpublished = {Cryptology ePrint Archive, Paper 2005/305},
year = {2005},
note = {\url{https://eprint.iacr.org/2005/305}},
url = {https://eprint.iacr.org/2005/305}
}
