Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions

DOI10.1109/TIT.2008.921684zbMath1330.94052arXivcs/0702161OpenAlexW3121904864MaRDI QIDQ3604649

Pierre Moulin, Ying Wang

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)

Related Items

Optimal \(M\)-PAM spread-spectrum data embedding with precoding, An Epistemological Approach to Steganography, Fisher Information Determines Capacity of ε-Secure Steganography, Estimating Steganographic Fisher Information in Real Images, On the gold standard for security of universal steganography, Steganographic capacity for one-dimensional Markov cover, On the universal steganography of optimal rate, Steganography protocols for quantum channels