
Proceedings Paper
Batch steganography and the threshold gameFormat | Member Price | Non-Member Price |
---|---|---|
$17.00 | $21.00 |
Paper Abstract
In Batch Steganography we assume that a Steganographer has to choose how to allocate a fixed amount of data
between a large number of covers. Given the existence of a steganalysis method for individual objects (satisfying
certain assumptions) we assume that a Warden attempts to detect the payload by pooling the evidence from all
the objects. This paper works out the details of a particular method for the Warden, which counts the number
of objects of which the detection statistic surpasses a certain threshold. This natural pooling method leads to a
game between the Warden and Steganographer, and there are different varieties depending on whether the moves
are sequential or simultaneous. The solutions are intriguing, suggesting that the Steganographer should always
concentrate the payload in as few covers as possible, or exactly the reverse, but never adopt an intermediate
strategy. Furthermore, the Warden's optimal strategies are instructive for the benchmarking of quantitative
steganalysis methods. Experimental results show that some steganography and steganalysis methods' empirical
performance accords with this theory.
Paper Details
Date Published: 2 March 2007
PDF: 13 pages
Proc. SPIE 6505, Security, Steganography, and Watermarking of Multimedia Contents IX, 650504 (2 March 2007); doi: 10.1117/12.703334
Published in SPIE Proceedings Vol. 6505:
Security, Steganography, and Watermarking of Multimedia Contents IX
Edward J. Delp III; Ping Wah Wong, Editor(s)
PDF: 13 pages
Proc. SPIE 6505, Security, Steganography, and Watermarking of Multimedia Contents IX, 650504 (2 March 2007); doi: 10.1117/12.703334
Show Author Affiliations
Andrew D. Ker, Oxford Univ. (United Kingdom)
Published in SPIE Proceedings Vol. 6505:
Security, Steganography, and Watermarking of Multimedia Contents IX
Edward J. Delp III; Ping Wah Wong, Editor(s)
© SPIE. Terms of Use
