Abstract
There have been some achievements in steganalysis recently. Many people have been making strides in steganalysis. They have approached steganalysis from different angles; from information theory to complexity theory. Anderson gave a possibility that there is a provable secure steganographic system, but there had not been complexity theoretical approaches for years. In 2002, Katzenbeisser and Petitcolas defined the conditional security of steganography and gave a possibility for a practical, provable secure steganography for the first time, and Hopper et al. introduced a provable secure steganographic algorithm in the sense of complexity theory. Chang et al. also tried to define the complexity theoretical security and showed a practical, provable secure algorithm. Chang et al. presented chose-input attack model in a view of pseudoprocessingness for a steganographic system. In this paper, we try to improve this notion in detail. So we define chosen-cover attack model and chosen-message attack model. Moreover, we present the relation between them.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, R.J.: Stretching the Limits of Steganography. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 39–48. Springer, Heidelberg (1996)
Cachin, C.: An Information-Theoretic Model for Steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306–318. Springer, Heidelberg (1998)
Chang, K., Deng, R., Feng, B., Lee, S., Kim, H.: On Security Notions of Steganographic Systems. In: International Workshop on Digital Watermarking 2004 (2004) (accepted)
Goldwasser, G., Bellare, M.: Lecture Notes on Modern Cryptography (August 2001), Available at http://www-cse.ucsd.edu/users/mihir/papers/gb.html
Hopper, N.J., Langford, J., von Ahn, L.: Provably Secure Steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 77–92. Springer, Heidelberg (2002)
Johnson, N.F., Duric, Z., Jajodia, S.: Information Hiding: Steganography and Watermarking Attacks and Contermeasures. Kluwer Academic Publishers, Dordrecht (2001)
Katzen Beisser, S., Petitcolas, F.A.P.: Information Hiding - techniques for steganography and digital watermarking. Artech House Books (1999)
Katzenbeisser, S., Petitcolas, F.A.P.: Defining Security in Steganographic Systems. In: Proceeding of the SPIE. Security and Watermarking of Multimedia Contents IV, vol. 4675, pp. 50–56 (2002)
Simmons, G.J.: The Prisoners’ Problem and the Subliminal Channe. In: CRYPTO 1983, pp. 51–67. Plenum Press, New York (1984)
Westfeld, A., Pfitzmann, A.: Attacks on Steganographic Systems. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol. 1768, pp. 61–76. Springer, Heidelberg (2000)
Zöllner, J., Federrath, H., Klimant, H., Pfitzmann, A., Piotraschke, R., Westfeld, A., Wicke, G., Wolf, G.: Modeling the security of steganographic systems. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 344–354. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, K., Deng, R.H., Feng, B., Lee, S., Kim, H., Lim, J. (2005). On Security Notions for Steganalysis. In: Park, Cs., Chee, S. (eds) Information Security and Cryptology – ICISC 2004. ICISC 2004. Lecture Notes in Computer Science, vol 3506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496618_32
Download citation
DOI: https://doi.org/10.1007/11496618_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26226-8
Online ISBN: 978-3-540-32083-8
eBook Packages: Computer ScienceComputer Science (R0)