Upper and Lower Bounds on Black-Box Steganography
| dc.creator | Dedić, Nenad | |
| dc.creator | Itkis, Gene | |
| dc.creator | Reyzin, Leonid | |
| dc.creator | Russell, Scott | |
| dc.date | 2008-06-04 | |
| dc.date.accessioned | 2026-07-07T09:42:42Z | |
| dc.date.available | 2026-07-07T09:42:42Z | |
| dc.description | 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). | |
| dc.description | 27 pages; to be published in Journal of Cryptology | |
| dc.identifier | https://arxiv.org/abs/0806.0837 | |
| dc.identifier | http://arxiv.org/abs/0806.0837 | |
| dc.identifier | doi:10.1007/s00145-008-9020-3 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162281 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Computational Complexity | |
| dc.subject | Information Theory | |
| dc.subject | D.4.6; E.3; H.1.1 | |
| dc.title | Upper and Lower Bounds on Black-Box Steganography | |
| dc.type | text |