Secret Writing on Dirty Paper: A Deterministic View

Author

El-Halabi, Mustafa ; Liu, Tie ; Georghiades, Costas N. ; Shamai, Shlomo

Author_Institution

Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA

Volume

58

Issue

6

fYear

2012

fDate

6/1/2012 12:00:00 AM

Firstpage

3419

Lastpage

3429

Abstract

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.

Keywords

Gaussian processes; deterministic algorithms; encoding; telecommunication channels; Gaussian network capacity; coding scheme; degraded Gaussian model; dirty paper; linear deterministic model; secrecy capacity; secret writing; side information; wiretap channel; Channel capacity; Encoding; Indexes; Interference; Receivers; Vectors; Writing; Dirty-paper coding; information-theoretic security; linear deterministic model; side information; wiretap channel;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2012.2190820

Filename

6168835