Upper and lower bounds on black-box steganography

DOI10.1007/S00145-008-9020-3MaRDI QIDQ1027982zbMATH OpenOpenAlexFDO

Authors Nenad Dedić, Gene Itkis, Leonid Reyzin, Scott Russell

Publication date 30 June 2009

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.0837

zbMATH Keywords

pseudorandomnesssteganographycovert communicationreject sampling

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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

Recommendations

• Theory of Cryptography
• On the universal steganography of optimal rate
• Constructing perfect steganographic systems
• scientific article; zbMATH DE number 6861949
• Grey-box steganography

Cites work

• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1942414 (Why is no real title available?)
• scientific article; zbMATH DE number 964178 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology - EUROCRYPT 2004
• Network Applications of Bloom Filters: A Survey
• On the implementation of huge random objects
• Probability Inequalities for Sums of Bounded Random Variables
• Space/time trade-offs in hash coding with allowable errors
• The Theory of Information and Coding
• Theory of Cryptography
• Theory of Cryptography

Cited in

(9)

• Grey-box steganography
• Provably Secure Steganography and the Complexity of Sampling
• On the universal steganography of optimal rate
• Security levels in steganography -- insecurity does not imply detectability
• Grey-box steganography
• Grey-box public-key steganography
• Theory of Cryptography
• On the gold standard for security of universal steganography
• Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless Sources

This page was built for publication: Upper and lower bounds on black-box steganography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027982)