A limited memory algorithm for bound constrained optimization
SIAM Journal on Scientific Computing
Detection of LSB Steganography via Sample Pair Analysis
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
A general framework for structural steganalysis of LSB replacement
IH'05 Proceedings of the 7th international conference on Information Hiding
The ultimate steganalysis benchmark?
Proceedings of the 9th workshop on Multimedia & security
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
The square root law requires a linear key
Proceedings of the 11th ACM workshop on Multimedia and security
Asymptotic behavior of the ZZW embedding construction
IEEE Transactions on Information Forensics and Security
Generalization of the ZZW embedding construction for steganography
IEEE Transactions on Information Forensics and Security
Watermarking: how secure is the DM-QIM embedding technique?
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Steganography using Gibbs random fields
Proceedings of the 12th ACM workshop on Multimedia and security
Gibbs construction in steganography
IEEE Transactions on Information Forensics and Security
Towards a protocol for autonomic covert communication
ATC'11 Proceedings of the 8th international conference on Autonomic and trusted computing
Defensive steganography: a novel way against steganalysis
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I
Batch steganography in the real world
Proceedings of the on Multimedia and security
Moving steganography and steganalysis from the laboratory into the real world
Proceedings of the first ACM workshop on Information hiding and multimedia security
Interpolation of steganographic schemes
Signal Processing
| Hi-index | 0.00 |
Conventional steganalysis aims to separate cover objects from stego objects, working on each object individually. In this paper we investigate some methods for pooling steganalysis evidence, so as to obtain more reliable detection of steganography in large sets of objects, and the dual problem of hiding information securely when spreading across a batch of covers. The results are rather surprising: in many situations, a steganographer should not spread the embedding across all covers, and the secure capacity increases only as the square root of the number of objects. We validate the theoretical results, which are rather general, by testing a particular type of image steganography. The experiments involve tens of millions of repeated steganalytic attacks and show that pooled steganalysis can give very reliable detection of even tiny proportionate payloads.