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

DOI10.1109/TIT.2008.921684MaRDI QIDQ3604649zbMATH OpenOpenAlexFDO

Authors Ying Wang, Pierre Moulin

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

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

Abstract: An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext, the resulting stegotext is required to have exactly the same probability distribution as the covertext. Then no statistical test can reliably detect the presence of the hidden message. We refer to such steganographic schemes as perfectly secure. A few such schemes have been proposed in recent literature, but they have vanishing rate. We prove that communication performance can potentially be vastly improved; specifically, our basic setup assumes independently and identically distributed (i.i.d.) covertext, and we construct perfectly secure steganographic codes from public watermarking codes using binning methods and randomized permutations of the code. The permutation is a secret key shared between encoder and decoder. We derive (positive) capacity and random-coding exponents for perfectly-secure steganographic systems. The error exponents provide estimates of the code length required to achieve a target low error probability. We address the potential loss in communication performance due to the perfect-security requirement. This loss is the same as the loss obtained under a weaker order-1 steganographic requirement that would just require matching of first-order marginals of the covertext and stegotext distributions. Furthermore, no loss occurs if the covertext distribution is uniform and the distortion metric is cyclically symmetric; steganographic capacity is then achieved by randomized linear codes. Our framework may also be useful for developing computationally secure steganographic systems that have near-optimal communication performance.

Recommendations

• Constructing perfect steganographic systems
• Asymptotically optimal perfect steganographic systems
• On the universal steganography of optimal rate
• An information-theoretic model for steganography
• Security levels in steganography -- insecurity does not imply detectability

Cited in

(30)

• Asymptotically optimal perfect steganographic systems
• A precise mimic function
• Fisher Information Determines Capacity of ε-Secure Steganography
• Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless Sources
• An Epistemological Approach to Steganography
• Estimating Steganographic Fisher Information in Real Images
• Coverings, centered codes, and combinatorial steganography
• Supraliminal Audio Steganography: Audio Files Tricking Audiophiles
• Information-theoretic analysis of information hiding
• Steganographic capacity for one-dimensional Markov cover
• Unconditionally Secure Steganography Against Active Attacks
• Linear codes for high payload steganography
• scientific article; zbMATH DE number 1893208 (Why is no real title available?)
• On the gold standard for security of universal steganography
• Public Key Cryptography - PKC 2006
• Constructing perfect steganographic systems
• Optimal \(M\)-PAM spread-spectrum data embedding with precoding
• Steganography based on pattern languages
• Steganography using overlapping codebook partition
• Provably Secure Steganography and the Complexity of Sampling
• On noise synchronization analysis in steganography using stochastic modulation
• scientific article; zbMATH DE number 1894623 (Why is no real title available?)
• scientific article; zbMATH DE number 1952745 (Why is no real title available?)
• Steganographic schemes from perfect codes on Cayley graphs
• Steganography protocols for quantum channels
• On causal and semicausal codes for joint information embedding and source coding
• Applied Cryptography and Network Security
• On the universal steganography of optimal rate
• Steganosis using wavelets conditional probability and primitive polynomials
• scientific article; zbMATH DE number 1893210 (Why is no real title available?)

This page was built for publication: Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions

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