The square root law requires a linear key
Proceedings of the 11th ACM workshop on Multimedia and security
Estimating the Information Theoretic Optimal Stego Noise
IWDW '09 Proceedings of the 8th International Workshop on Digital Watermarking
The square root law does not require a linear key
Proceedings of the 12th ACM workshop on Multimedia and 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
Digital image steganography using universal distortion
Proceedings of the first ACM workshop on Information hiding and multimedia security
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 | 0.00 |
Most practical stegosystems for digital media work by applying a mutually independent embedding operation to each element of the cover. For such stegosystems, the Fisher information w.r.t. the change rate is a perfect security descriptor equivalent to KL divergence between cover and stego images. Under the assumption of Markov covers, we derive a closed-form expression for the Fisher information and show how it can be used for comparing stegosystems and optimizing their performance. In particular, using an analytic cover model fit to experimental data obtained from a large number of natural images, we prove that the 卤1 embedding operation is asymptotically optimal among all mutually independent embedding operations that modify cover elements by at most 1.