Upper and lower bounds on black-box steganography

DOI10.1007/S00145-008-9020-3zbMATH Open1172.94007arXiv0806.0837OpenAlexW3099386058MaRDI QIDQ1027982FDOQ1027982

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

Publication date: 30 June 2009

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

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

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

Recommendations

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

zbMATH Keywords

pseudorandomnesssteganographycovert communicationreject sampling

Mathematics Subject Classification ID

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

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• A Pseudorandom Generator from any One-way Function
• Space/time trade-offs in hash coding with allowable errors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Network Applications of Bloom Filters: A Survey
• The Theory of Information and Coding
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Theory of Cryptography
• Theory of Cryptography
• On the Implementation of Huge Random Objects

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
• Theory of Cryptography
• On the gold standard for security of universal steganography
• Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless Sources
• Grey-Box Steganography
• Grey-Box Public-Key Steganography

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)