On security notions for steganalysis

Kisik Chang, Robert H. Deng, Bao Feng, Sangjin Lee, Hyungjun Kim, Jong In Lim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsC. Park, S. Chee
Number of pages15
Publication statusPublished - 2005
Event7th International Conference on Information Security and Cryptology - ICISC 2004 - Seoul, Korea, Republic of
Duration: 2004 Dec 22004 Dec 3


Other7th International Conference on Information Security and Cryptology - ICISC 2004
CountryKorea, Republic of



  • Pseudoprocessingness
  • Steganalysis
  • Steganography

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Chang, K., Deng, R. H., Feng, B., Lee, S., Kim, H., & Lim, J. I. (2005). On security notions for steganalysis. In C. Park, & S. Chee (Eds.), Lecture Notes in Computer Science (Vol. 3506, pp. 440-454)