The square root law of steganographic capacity
Proceedings of the 10th ACM workshop on Multimedia and security
Perturbation Hiding and the Batch Steganography Problem
Information Hiding
Capacity of steganographic channels
IEEE Transactions on Information Theory
Problems of modeling in the analysis of covert channels
MMM-ACNS'10 Proceedings of the 5th international conference on Mathematical methods, models and architectures for computer network security
The square root law in stegosystems with imperfect information
IH'10 Proceedings of the 12th international conference on Information hiding
Using high-dimensional image models to perform highly undetectable steganography
IH'10 Proceedings of the 12th international conference on Information hiding
How quantization based schemes can be used in image steganographic context
Image Communication
Multimedia Tools and Applications
KL-sense secure image steganography
International Journal of Security and Networks
Benchmarking for steganography by kernel fisher discriminant criterion
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
A game-theoretic approach to content-adaptive steganography
IH'12 Proceedings of the 14th international conference on Information Hiding
Moving steganography and steganalysis from the laboratory into the real world
Proceedings of the first ACM workshop on Information hiding and multimedia security
Message in a bottle: sailing past censorship
Proceedings of the 29th Annual Computer Security Applications Conference
Blacknoise: lightweight low-fi steganography in defense of free speech
Proceedings of the 4th Annual Symposium on Computing for Development
Hi-index | 754.90 |
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 independent 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. In some applications, steganographic communication may be disrupted by an active warden, modeled here by a compound discrete memoryless channel (DMC). The transmitter and warden are subject to distortion constraints. 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.