Paper 2004/246 Original: eprint.iacr.org/2004/246 ↗
Upper and Lower Bounds on Black-Box Steganography
Abstract
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negative side, we show that the number of samples the sender must obtain from the channel is exponential in the rate of the stegosystem. On the positive side, we present the first secret-key stegosystem that essentially matches this lower bound regardless of the entropy of the underlying channel. Furthermore, for high-entropy channels, we present the first secret-key stegosystem that matches this lower bound statelessly (i.e., without requiring synchronized state between sender and receiver).
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2008-06-04: last updated
- 2004-09-22: published
- Short URL
- https://ia.cr/2004/246
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/246,
author = {Nenad Dedic and Gene Itkis and Leonid Reyzin and Scott Russell},
title = {Upper and Lower Bounds on Black-Box Steganography},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/246},
year = {2004},
url = {https://eprint.iacr.org/2004/246}
}