An information-theoretic model for steganography
Information and Computation
Batch steganography and pooled steganalysis
IH'06 Proceedings of the 8th international conference on Information hiding
Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding
IEEE Transactions on Information Forensics and Security
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
IEEE Transactions on Information Theory
Batch steganography in the real world
Proceedings of the on Multimedia and security
Secret sharing with multi-cover adaptive steganography
Information Sciences: an International Journal
| Hi-index | 0.00 |
The batch steganography problem is how best to split a steganographic payload between multiple covers. This paper makes some progress towards an information-theoretic analysis of batch steganography by describing a novel mathematical abstraction we call perturbation hiding . As well as providing a new challenge for information hiding research, it brings into focus the information asymmetry in steganalysis of multiple objects: Kerckhoffs' Principle must be interpreted carefully. Our main result is the solution of the perturbation hiding problem for a certain class of distributions, and the implication for batch steganographic embedding. However, numerical computations show that the result does not hold for all distributions, and we provide some additional asymptotic results to help explore the problem more widely.