Welcome to the resource topic for 2000/028
Title:
An Information-Theoretic Model for Steganography
Authors: Christian Cachin
Abstract:An information-theoretic model for steganography with a passive adversary is
proposed. The adversary’s task of distinguishing between an innocent cover
message C and a modified message S containing hidden information is
interpreted as a hypothesis testing problem. The security of a
steganographic system is quantified in terms of the relative entropy (or
discrimination) between the distributions of C and S, which yields
bounds on the detection capability of any adversary. It is shown that
secure steganographic schemes exist in this model provided the covertext
distribution satisfies certain conditions. A universal stegosystem is
presented in this model that needs no knowledge of the covertext
distribution, except that it is generated from independently repeated
experiments.
ePrint: https://eprint.iacr.org/2000/028
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .