Abstract
We provide construction of steganographic schemes secure against adaptive chosen stegotext attacks. Our constructions achieve embedding rate equals to the Shannon entropy bound on steganographic channel capacity. Further the covertext distribution can be given as either an integrable probability function or as a random covertext sampler. We also introduce steganographic codes that are of interests in constructing other steganographic protocols such as steganographic secret sharing or steganographic distributed computations.
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
Anderson, R.J., Petitcolas, F.A.P.: On the limits of steganography. IEEE Journal of Selected Areas in Communications 16(4), 474–481 (1998)
Backes, M., Cachin, C.: Public key steganography with active attacks. Technical report, IACR ePrint Archive 2003/231 (2003)
Cachin, C.: An information-theoretic model for steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306–318. Springer, Heidelberg (1998)
Craver, S.: On public-key steganography in the presence of an active warden. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 14–17. Springer, Heidelberg (1998)
Csiszar.: The method of types. IEEETIT: IEEE Transactions on Information Theory, 44 (1998)
Csiszar, I., Korner, J.: Information theory: Coding Theory for Discrete Memoryless Systems. Academic Press, NewYork (1981)
Gurther, G.: A universal algorithm for homophonic coding. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, Springer, Heidelberg (1988)
Hopper, N., Langford, J., von Ahn, L.: Provably secure steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, Springer, Heidelberg (2002)
Hopper, N., von Ahn, L.: Public key steganography. In: Crypto 2003 (submitted)
Katzenbeisser, S., Petitcolas, F.: On defining security in steganographic systems (2002)
Mittelholzer. An information-theoretic approach to steganography and watermarking. In A. Pfitzmann, editor, Proceedings of Third International Workshop on Information Hiding, volume 1768 of LNCS. Springer-Verlag, September 1998.
Moulin, P., O’Sullivan, J.: Information-theoretic analysis of information hiding (1999)
Reyzin, L., Russell, S.: More efficient provably secure steganography. Technical report, IACR ePrint Archive 2003/093 (2003)
Simmons, G.J.: The prisoner’s problem and the subliminal channel. In: Chaum, D. (ed.) Advances in Cryptology: Proceedings of Crypto 1983, New York, USA, pp. 51–70. Plenum Publishing, New York, USA (1984)
von Ahn, L., Hopper, N.: Public key steganography. In: Eurocrypt 2004 (submitted)
Zollner, J., Federrath, H., Klimant, H., Pfitzmann, A., Piotraschke, R., Westfeld, A., Wicke, G., Wolf, G.: Modeling the security of steganographic systems. In: Information Hiding, pp. 344–354 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Le, T., Kurosawa, K. (2007). Bandwidth Optimal Steganography Secure Against Adaptive Chosen Stegotext Attacks. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds) Information Hiding. IH 2006. Lecture Notes in Computer Science, vol 4437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74124-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-74124-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74123-7
Online ISBN: 978-3-540-74124-4
eBook Packages: Computer ScienceComputer Science (R0)