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)

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.

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

Other

Other7th International Conference on Information Security and Cryptology - ICISC 2004
CountryKorea, Republic of
CitySeoul
Period04/12/204/12/3

Fingerprint

Steganography
Information theory

Keywords

  • 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)

On security notions for steganalysis. / Chang, Kisik; Deng, Robert H.; Feng, Bao; Lee, Sangjin; Kim, Hyungjun; Lim, Jong In.

Lecture Notes in Computer Science. ed. / C. Park; S. Chee. Vol. 3506 2005. p. 440-454.

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

Chang, K, Deng, RH, Feng, B, Lee, S, Kim, H & Lim, JI 2005, On security notions for steganalysis. in C Park & S Chee (eds), Lecture Notes in Computer Science. vol. 3506, pp. 440-454, 7th International Conference on Information Security and Cryptology - ICISC 2004, Seoul, Korea, Republic of, 04/12/2.
Chang K, Deng RH, Feng B, Lee S, Kim H, Lim JI. On security notions for steganalysis. In Park C, Chee S, editors, Lecture Notes in Computer Science. Vol. 3506. 2005. p. 440-454
Chang, Kisik ; Deng, Robert H. ; Feng, Bao ; Lee, Sangjin ; Kim, Hyungjun ; Lim, Jong In. / On security notions for steganalysis. Lecture Notes in Computer Science. editor / C. Park ; S. Chee. Vol. 3506 2005. pp. 440-454
@inproceedings{081814f06e754c25a64ea0775e084bca,
title = "On security notions for steganalysis",
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.",
keywords = "Pseudoprocessingness, Steganalysis, Steganography",
author = "Kisik Chang and Deng, {Robert H.} and Bao Feng and Sangjin Lee and Hyungjun Kim and Lim, {Jong In}",
year = "2005",
language = "English",
volume = "3506",
pages = "440--454",
editor = "C. Park and S. Chee",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - On security notions for steganalysis

AU - Chang, Kisik

AU - Deng, Robert H.

AU - Feng, Bao

AU - Lee, Sangjin

AU - Kim, Hyungjun

AU - Lim, Jong In

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Pseudoprocessingness

KW - Steganalysis

KW - Steganography

UR - http://www.scopus.com/inward/record.url?scp=24944554811&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944554811&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3506

SP - 440

EP - 454

BT - Lecture Notes in Computer Science

A2 - Park, C.

A2 - Chee, S.

ER -