Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ker, A.: Batch steganography and pooled steganalysis. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds.) IH 2006. LNCS, vol. 4437, pp. 265–281. Springer, Heidelberg (2007)
Ker, A.: Batch steganography and the threshold game. In: Security, Steganography and Watermarking of Multimedia Contents IX. In: Proc. SPIE, vol. 6505, pp. 0401–0413 (2007)
Ker, A.: Steganographic strategies for a square distortion function. In: Security, Forensics, Steganography and Watermarking of Multimedia Contents X. In: Proc. SPIE, vol. 6819 (2008)
Ker, A.: A capacity result for batch steganography. IEEE Signal Processing Letters 14(8), 525–528 (2007)
Cachin, C.: An information-theoretic model for steganography. Information and Computation 192(1), 41–56 (2004)
Wang, Y., Moulin, P.: Perfectly secure steganography: Capacity, error exponents, and code constructions. IEEE Trans. Information Theory (to appear, 2008)
Kullback, S., Leibler, R.: On information and sufficiency. Annals of Mathematical Statistics 22, 79–86 (1951)
Kerckhoffs, A.: La cryptographie militaire. Journal des sciences militaires IX, 5–38, 161–191 (1883)
Cayre, F., Bas, P.: Kerckhoffs-based embedding security classes for WOA data-hiding. IEEE Trans. Information Forensics and Security (to appear, 2008)
Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. Information Theory 29(2), 198–208 (1983)
Darmois, G.: Sur les lois de probabilité à estimation exhaustive. Comptes Rendus de l’Académie des Sciences 200, 1265–1266 (1935)
Fridrich, J., Soukal, D.: Matrix embedding for large payloads. IEEE Trans. Information Forensics and Security 1(3), 390–394 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ker, A.D. (2008). Perturbation Hiding and the Batch Steganography Problem. In: Solanki, K., Sullivan, K., Madhow, U. (eds) Information Hiding. IH 2008. Lecture Notes in Computer Science, vol 5284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88961-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-88961-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88960-1
Online ISBN: 978-3-540-88961-8
eBook Packages: Computer ScienceComputer Science (R0)