Secret Writing on Dirty Paper: A Deterministic View

被引：24

作者：

El-Halabi, Mustafa ^{[1
]}

Liu, Tie ^{[1
]}

Georghiades, Costas N. ^{[1
]}

Shamai , Shlomo ^{[2
]}

机构：

[1] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA

[2] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2012年 / 58卷 / 06期

基金：

美国国家科学基金会; 以色列科学基金会;

关键词：

Dirty-paper coding; information-theoretic security; linear deterministic model; side information; wiretap channel; CHANNEL CAPACITY; SIDE INFORMATION; WIRETAP CHANNEL;

D O I：

10.1109/TIT.2012.2190820

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Recently, there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as "secret writing on dirty paper") to within half a bit.

引用

页码：3419 / 3429

页数：11

共 15 条

[11] FEEDBACK CAN AT MOST DOUBLE GAUSSIAN MULTIPLE ACCESS CHANNEL CAPACITY [J].

THOMAS, JA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (05) :711-716

[12] Capacity of Channels With Action-Dependent States [J].

Weissman, Tsachy .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (11) :5396-5411

[13]

WILLEMS FMJ, 2000, P 21 S INF THEOR BEN, P255

[14] WIRE-TAP CHANNEL [J].

WYNER, AD .

BELL SYSTEM TECHNICAL JOURNAL, 1975, 54 (08) :1355-1387

[15] Nested linear/lattice codes for structured multiterminal binning [J].

Zamir, R ;

Shamai, S ;

Erez, U .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (06) :1250-1276

← 1 2 →