An Information-Theoretic Model for Steganography

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.

• Type: Conference
• Year: 1998
• Where: IH
• Authors: Christian Cachin
• Keywords: IH 1998, Information Management, Innocent Cover Message, Modi Ed Message, Secure Steganographic Schemes