Constructing perfect steganographic systems

被引：7

作者：

Ryabko, Boris ^{[1
,2
]}

Ryabko, Daniil ^{[3
]}

机构：

[1] Siberian State Univ Telecommunicat & Informat Sci, Novosibirsk 630102, Russia

[2] Russian Acad Sci, Inst Computat Technol, Siberian Branch, Novosibirsk 630102, Russia

[3] INRIA Lille, F-59650 Villeneuve Dascq, France

来源：

INFORMATION AND COMPUTATION | 2011年 / 209卷 / 09期

关键词：

Steganography; Kolmogorov complexity; Information theory; Shannon entropy;

D O I：

10.1016/j.ic.2011.06.004

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We propose steganographic systems for the case when covertexts (containers) are generated by a finite-memory source with possibly unknown statistics. The probability distributions of covertexts with and without hidden information are the same; this means that the proposed stegosystems are perfectly, secure. i.e. an observer cannot determine whether hidden information is being transmitted. The speed of transmission of hidden information can be made arbitrary close to the theoretical limit - the Shannon entropy of the source of covertexts. An interesting feature of the suggested stegosystems is that they do not require any (secret or public) key. At the same time, we outline some principled computational limitations on steganography. We show that there are such sources of covertexts, that any stegosystem that has linear (in the length of the covertext) speed of transmission of hidden text must have an exponential Kolmogorov complexity. This shows, in particular, that some assumptions on the sources of covertext are necessary. (C) 2011 Elsevier Inc. All rights reserved.

引用

页码：1223 / 1230

页数：8

共 19 条

[1]

[Anonymous], 1989, Kolmogorov Complexity and Its Applications

[2] An information-theoretic model for steganography [J].

Cachin, C .

INFORMATION AND COMPUTATION, 2004, 192 (01) :41-56

[3]

COVER TM, 1973, IEEE T INFORM THEORY, V19, P73, DOI 10.1109/TIT.1973.1054929

[4] The method of types [J].

Csiszar, I .

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

[5] COMMENTS ON SEQUENCE TIME CODING FOR DATA COMPRESSION [J].

DAVISSON, LD .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1966, 54 (12) :2010-&

[6]

Krichevsky R., 1993, Universal Compression and Retrival

[7] SEQUENCE TIME CODING FOR DATA COMPRESSION [J].

LYNCH, TJ .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1966, 54 (10) :1490-&

[8]

Menzes A., 1996, Handbook of Applied Cryptography

[9] Asymptotically optimal perfect steganographic systems [J].

Ryabko, B. Ya. ;

Ryabko, D. B. .

PROBLEMS OF INFORMATION TRANSMISSION, 2009, 45 (02) :184-190

[10] Information-theoretic approach to steganographic systems [J].

Ryabko, Boris ;

Ryabko, Daniil .

2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, :2461-+

← 1 2 →