Upper and Lower Bounds on Black-Box Steganography

Authors:
Nenad Dedić;Gene Itkis;Leonid Reyzin;Scott Russell
Affiliations:
Boston University, Department of Computer Science, 111 Cummington Street, 02215, Boston, MA, USA;Boston University, Department of Computer Science, 111 Cummington Street, 02215, Boston, MA, USA;Boston University, Department of Computer Science, 111 Cummington Street, 02215, Boston, MA, USA;Boston University, Department of Computer Science, 111 Cummington Street, 02215, Boston, MA, USA
Venue:
Journal of Cryptology
Year:
2009

Citing 0
Cited 2

Grey-box steganography

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Grey-box steganography

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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).