Upper and Lower Bounds on Black-Box Steganography
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).
KeywordsSteganography Covert communication Rejection sampling Lower bound Pseudorandomnness Information hiding Huge random objects
Unable to display preview. Download preview PDF.
- M. Backes, C. Cachin, Public-key steganography with active attacks, in Second Theory of Cryptography Conference—TCC 2005, ed. by J. Kilian, Lecture Notes in Computer Science, vol. 3378 (Springer, New York, 1995), pp. 210–226 Google Scholar
- A. Broder, M. Mitzenmacher, Network applications of bloom filters: A survey, in Proceedings of the Fortieth Annual Allerton Conference on Communication, Control and Computing, 2002 Google Scholar
- N. Dedić, G. Itkis, L. Reyzin, S. Russell, Upper and lower bounds on black-box steganography, in Second Theory of Cryptography Conference—TCC 2005, ed. by J. Kilian, Lecture Notes in Computer Science, vol. 3378 (Springer, New York, 1995), pp. 227–244 Google Scholar
- O. Goldreich, S. Goldwasser, A. Nussboim, On the implementation of huge random objects, in 44th Annual Symposium on Foundations of Computer Science, Cambridge, MA, 2003. IEEE, pp. 68–79 Google Scholar
- N. Hopper, J. Langford, L. von Ahn, Provably secure steganography. Technical Report 2002/137, Cryptology e-print archive, http://eprint.iacr.org, 2002. Preliminary version in Crypto 2002
- N.J. Hopper, Toward a Theory of Steganography. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA, July 2004. Available as Technical Report CMU-CS-04-157 Google Scholar
- L. Kissner, T. Malkin, O. Reingold, Private communication to N. Hopper, J. Langford, L. von Ahn, 2002 Google Scholar
- T. Van Le, Efficient provably secure public key steganography. Technical Report 2003/156, Cryptology e-print archive, http://eprint.iacr.org, 2003
- T. Van Le, K. Kurosawa, Efficient public key steganography secure against adaptively chosen stegotext attacks. Technical Report 2003/244, Cryptology e-print archive, http://eprint.iacr.org, 2003
- L. Reyzin, A note on the statistical difference of small direct products. Technical Report BUCS-TR-2004-032, CS Department, Boston University, September 21, 2004. Available from http://www.cs.bu.edu/techreports/
- L. von Ahn, N.J. Hopper, Public-key steganography, in Advances in Cryptology—EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, Lecture Notes in Computer Science, vol. 3027 (Springer, New York, 2004) Google Scholar