Journal
INFORMATION AND COMPUTATION
Volume 192, Issue 1, Pages 41-56Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.ic.2004.02.003
Keywords
information hiding; covert channel; subliminal channel; perfect security; one-time pad; universal data compression
Ask authors/readers for more resources
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. (C) 2004 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available