Upper and Lower Bounds on Black-Box Steganography

Details Upper and Lower Bounds on Black-Box Steganography Upper and Lower Bounds on Black-Box Steganography

2008-06-04

arxiv.org/abs/0806.0837v1

Computer Science

Cryptography and Security

27 pages; to be published in Journal of Cryptology

Scientific paper

10.1007/s00145-008-9020-3

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

Affiliated with

Also associated with

No associations

Rating

Upper and Lower Bounds on Black-Box Steganography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Upper and Lower Bounds on Black-Box Steganography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper and Lower Bounds on Black-Box Steganography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154957