Elements of information theory
Elements of information theory
An information-theoretic model for steganography
Information and Computation
Locating steganographic payload via ws residuals
Proceedings of the 10th ACM workshop on Multimedia and security
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Fisher Information Determines Capacity of ε-Secure Steganography
Information Hiding
Estimating Steganographic Fisher Information in Real Images
Information Hiding
Batch steganography and pooled steganalysis
IH'06 Proceedings of the 8th international conference on Information hiding
Watermarking security: theory and practice
IEEE Transactions on Signal Processing - Part II
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
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
| Hi-index | 0.00 |
We extend the square root law of steganographic capacity, for the simplest case of iid covers, in two ways. First, we show that the law still holds under a more realistic embedding assumption, where the payload is of fixed length (instead of, in the classic result, independent embedding at each location). Second, we consider the case of nonuniform embedding paths, which is forced when the stegosystem's secret key is of limited size: we show that the secret key must be of length at least linear in the payload size, if a square root law is to hold. The latter is parallel to Shannon's perfect cryptography bound.