Information Hiding

Volume 1525 of the series Lecture Notes in Computer Science pp 306-318


An Information-Theoretic Model for Steganography

  • Christian CachinAffiliated withMIT Laboratory for Computer Science

* Final gross prices may vary according to local VAT.

Get Access


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 modified message S containing a secret part is interpreted as a hypothesis testing problem. The security of a steganographic system is quantified in terms of the relative entropy (or discrimination) between P C and P S. 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.