Abstract
Theoretical results about the capacity of stegosystems typically assume that one or both of the adversaries has perfect knowledge of the cover source. So-called perfect steganography is possible if the embedder has this perfect knowledge, and the Square Root Law of capacity applies when the embedder has imperfect knowledge but the detector has perfect knowledge. The epistemology of stegosystems is underdeveloped and these assumptions are sometimes unstated. In this work we consider stegosystems where the detector has imperfect information about the cover source: once the problem is suitably formalized, we show a parallel to the Square Root Law. This answers a question raised by Böhme.
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
Böhme, R.: Improved Statistical Steganalysis using Models of Heterogeneous Cover Signals. Ph.D. thesis, Technische Universität Dresden (2008)
Böhme, R.: An epistemological approach to steganography. In: Katzenbeisser, S., Sadeghi, A.-R. (eds.) IH 2009. LNCS, vol. 5806, pp. 15–30. Springer, Heidelberg (2009)
Cachin, C.: An information-theoretic model for steganography. Information and Computation 192(1), 41–56 (2004)
Cover, T., Thomas, J.: Elements of Information Theory. Wiley, USA (1991)
Filler, T., Fridrich, J.: Fisher Information determines capacity of ε-secure steganography. In: Katzenbeisser, S., Sadeghi, A.-R. (eds.) IH 2009. LNCS, vol. 5806, pp. 31–47. Springer, Heidelberg (2009)
Filler, T., Ker, A., Fridrich, J.: The square root law of steganographic capacity for Markov covers. In: Delp III, E., Dittmann, J., Memon, N., Wong, P. (eds.) Media Forensics and Security XI. Proc. SPIE, vol. 7254, pp. 0801–0811 (2009)
Fridrich, J., Lisoněk, P., Soukal, D.: On steganographic embedding efficiency. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds.) IH 2006. LNCS, vol. 4437, pp. 282–296. Springer, Heidelberg (2007)
Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Boston (1994)
Hopper, N., Langford, J., von Ahn, L.: Provable secure steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 77–92. Springer, Heidelberg (2002)
Katzenbeisser, S., Petitcolas, F.: Defining security in steganographic systems. In: Delp III, E., Wong, P. (eds.) Security and Watermarking of Multimedia Contents IV. Proc. SPIE, vol. 4675, pp. 50–56 (2002)
Ker, A.: The Square Root Law does not require a linear key. To appear in MM&Sec 2010: Proceedings of the 12th ACM workshop on Multimedia and Security (2010)
Ker, A.: Estimating steganographic Fisher Information in real images. In: Katzenbeisser, S., Sadeghi, A.-R. (eds.) IH 2009. LNCS, vol. 5806, pp. 73–88. Springer, Heidelberg (2009)
Ker, A.: The Square Root Law requires a linear key. In: Felten, E., Dittmann, J., Fridrich, J., Craver, S. (eds.) Proceedings of the 11th ACM Workshop on Multimedia and Security. MM&Sec 2009, pp. 85–92. ACM Press, New York (2009)
Ker, A.: The Uniform Prior and Zero Information: A Technical Note, Oxford University Computing Laboratory Research Report CS-RR-10-06 (2010)
Ker, A., Pevný, T., Kodovský, J., Fridrich, J.: The square root law of steganographic capacity. In: Ker, A., Dittmann, J., Fridrich, J. (eds.) MM&Sec 2008: Proceedings of the 10th ACM Workshop on Multimedia and Security. MM&Sec 2008, pp. 107–116. ACM Press, New York (2008)
Lehmann, E., Romano, J.: Testing Statistical Hypotheses, 3rd edn. Springer, Heidelberg (2005)
Sallee, P.: Model-based methods for steganography and steganalysis. International J. Image and Graphics 5(1), 167–189 (2005)
Wang, Y., Moulin, P.: Perfectly secure steganography: Capacity, error exponents, and code constructions. IEEE Trans. Inf. Th. 54(6), 2706–2722 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ker, A.D. (2010). The Square Root Law in Stegosystems with Imperfect Information. In: Böhme, R., Fong, P.W.L., Safavi-Naini, R. (eds) Information Hiding. IH 2010. Lecture Notes in Computer Science, vol 6387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16435-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-16435-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16434-7
Online ISBN: 978-3-642-16435-4
eBook Packages: Computer ScienceComputer Science (R0)