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