Abstract
The goal of steganography is to pass secret messages by disguising them as innocent-looking covertexts. Real world stegosystems are often broken because they make invalid assumptions about the system’s ability to sample covertexts. We examine whether it is possible to weaken this assumption. By modeling the covertext distribution as a stateful Markov process, we create a sliding scale between real world and provably secure stegosystems. We also show that insufficient knowledge of past states can have catastrophic results.
Chapter PDF
Similar content being viewed by others
References
Anderson, R.J., Petitcolas, F.A.: On the limits of steganography. IEEE Journal on Selected Areas in Communications 16(4), 474–481 (1998)
Backes, M., Cachin, C.: Public-key steganography with active attacks. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 210–226. Springer, Heidelberg (2005)
Cachin, C.: An information-theoretic model for steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306–318. Springer, Heidelberg (1998)
Dedić, N., Itkis, G., Reyzin, L., Russell, S.: Upper and lower bounds on black-box steganography. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 227–244. Springer, Heidelberg (2005)
Goldreich, O.: Foundations of cryptography. Basic applications, vol. 2 (2004)
Hopper, N.J., Langford, J., von Ahn, L.: Provably secure steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, p. 77. Springer, Heidelberg (2002)
Hopper, N.J.: Toward a theory of steganography. CMU Ph.D. Thesis (2004)
Hopper, N.J.: On steganographic chosen covertext security. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 311–323. Springer, Heidelberg (2005)
Van Le, T.: Efficient provably secure public key steganography. Technical report, Florida State University, Cryptography ePrint Archive (2003), http://eprint.iacr.org/2003/156
Van Le, T., Kurosawa, K.: Efficient public key steganography secure against adaptively chosen stegotext attacks. Technical report, Florida State University, Cryptography ePrint Archive (2003) http://eprint.iacr.org/2003/244
Lysyanskaya, A., Meyerovich, M.: Steganography with imperfect sampling. In: CRYPTO 2004 Rump Session, August 2004 (2004)
Lysyanskaya, A., Meyerovich, M.: Steganography with imperfect sampling. Technical Report ePrint Archive 2005/305, Brown University, Cryptography ePrint Archive (2005), http://eprint.iacr.org/2005/305
Moskowitz, I.S., Longdon, G.E., Chang, L.: A new paradigm hidden in steganography. In: Proceedings of the 2000 workshop on New Security Paradigms, ACM Press, New York (2001)
Petrowski, K., Kharrazi, M., Sencar, H.T., Memon, N.: Psteg: steganographic embedding through patching. In: 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing (2005)
Reyzin, L., Russell, S.: Simple stateless steganography. Technical Report ePrint Archive 2003/093, Boston University, Cryptography ePrint Archive (2003), http://eprint.iacr.org/2003/093
Sallee, P.: Model-based steganography. In: Kalker, T., Cox, I., Ro, Y.M. (eds.) IWDW 2003. LNCS, vol. 2939, pp. 154–167. Springer, Heidelberg (2004)
von Ahn, L., Hopper, N.J.: Public-key steganography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 323–341. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lysyanskaya, A., Meyerovich, M. (2006). Provably Secure Steganography with Imperfect Sampling. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds) Public Key Cryptography - PKC 2006. PKC 2006. Lecture Notes in Computer Science, vol 3958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11745853_9
Download citation
DOI: https://doi.org/10.1007/11745853_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33851-2
Online ISBN: 978-3-540-33852-9
eBook Packages: Computer ScienceComputer Science (R0)