Upper and Lower Bounds on Black-Box Steganography
Preprint
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).Keywords
All Related Versions
- Version 1, 2008-06-04, ArXiv
- Published version: Journal of Cryptology, 22 (3), 365.
This publication has 2 references indexed in Scilit:
- A Modern Approach to Probability TheoryJournal of the American Statistical Association, 1999
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970