An Information-Theoretic Model for Steganography

An Information-Theoretic Model for Steganography (1998)

by Christian Cachin

Citations:

165 - 3 self

Datum	Value	Source
TITLE	An information-theoretic model for steganography	INFERENCE
AUTHOR NAME	Christian Cachin	SVM HeaderParse 0.1
AUTHOR AFFIL	MIT Laboratory for Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	545 Technology Square; Cambridge, MA 02139, USA	SVM HeaderParse 0.1
ABSTRACT	An information-theoretic model for steganography with passive adversaries is proposed. The adversary's task of distinguishing between an innocent cover message C and a modi ed message S containing a secret part is interpreted as a hypothesis testing problem. The security of a steganographic system is quanti ed in terms of the relative entropy (or discrimination) between PC and PS. Several secure steganographic schemes are presented in this model; one of them is a universal information hiding scheme based on universal data compression techniques that requires no knowledge of the covertext statistics. 1	SVM HeaderParse 0.1
YEAR	1998	INFERENCE
VENUE	in Information Hiding, 2nd International Workshop	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	306--318	INFERENCE
VOLUME	1525	INFERENCE
CITATIONS	20 found	ParsCit 1.0