An information-theoretic model for steganography

被引：205

作者：

Cachin, C ^{[1
]}

机构：

[1] IBM Corp, Zurich Res Lab, CH-8803 Ruschlikon, Switzerland

来源：

INFORMATION AND COMPUTATION | 2004年 / 192卷 / 01期

关键词：

information hiding; covert channel; subliminal channel; perfect security; one-time pad; universal data compression;

D O I：

10.1016/j.ic.2004.02.003

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：41 / 56

页数：16

共 17 条

[1]

Bell T. C., 1990, TEXT COMPRESSION

[2]

Blahut R.E., 1987, Principles and Practice of Information Theory

[3]

Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X

[4]

Cox I. J., 2002, DIGITAL WATERMARKING

[5] The method of types [J].

Csiszar, I .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2505-2523

[6]

CSISZAR I, 1981, INFORMATION THEORY C

[7]

Ettinger JM, 1998, LECT NOTES COMPUT SC, V1525, P319

[8]

Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness

[9]

Hopper NJ, 2002, LECT NOTES COMPUT SC, V2442, P77

[10] Securing symmetric watermarking schemes against protocol attacks [J].

Katzenbeisser, S ;

Veith, H .

SECURITY AND WATERMARKING OF MULTIMEDIA CONTENTS IV, 2002, 4675 :260-268

← 1 2 →