Secret writing on dirty paper: A deterministic view

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

doi:https://doi.org/10.1109/TIT.2012.2190820

Secret writing on dirty paper: A deterministic view

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

Electrical and Computer Engineering

Technion - Israel Institute of Technology

Research output: Contribution to journal › Review article › peer-review

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.

Original language	English
Article number	6168835
Pages (from-to)	3419-3429
Number of pages	11
Journal	IEEE Transactions on Information Theory
Volume	58
Issue number	6
DOIs	https://doi.org/10.1109/TIT.2012.2190820
State	Published - 2012

Keywords

Dirty-paper coding
information-theoretic security
linear deterministic model
side information
wiretap channel

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

https://doi.org/10.1109/TIT.2012.2190820

Cite this

@article{48d121cbc66940dab26d2ea606294efe,

title = "Secret writing on dirty paper: A deterministic view",

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 = "Dirty-paper coding, information-theoretic security, linear deterministic model, side information, wiretap channel",

author = "Mustafa El-Halabi and Tie Liu and Georghiades, {Costas N.} and Shlomo Shamai",

note = "Funding Information: Manuscript received March 19, 2011; revised January 04, 2012; accepted March 04, 2012. Date of publication March 13, 2012; date of current version May 15, 2012. This work was supported in part by the National Science Foundation under Grant CCF-08-45848, by the European Commission in the framework of the FP7 Network of Excellence in Wireless Communications NEWCOM++, and by the Israel Science Foundation.",

year = "2012",

doi = "https://doi.org/10.1109/TIT.2012.2190820",

language = "الإنجليزيّة",

volume = "58",

pages = "3419--3429",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Secret writing on dirty paper

T2 - A deterministic view

AU - El-Halabi, Mustafa

AU - Liu, Tie

AU - Georghiades, Costas N.

AU - Shamai, Shlomo

N1 - Funding Information: Manuscript received March 19, 2011; revised January 04, 2012; accepted March 04, 2012. Date of publication March 13, 2012; date of current version May 15, 2012. This work was supported in part by the National Science Foundation under Grant CCF-08-45848, by the European Commission in the framework of the FP7 Network of Excellence in Wireless Communications NEWCOM++, and by the Israel Science Foundation.

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Dirty-paper coding

KW - information-theoretic security

KW - linear deterministic model

KW - side information

KW - wiretap channel

UR - http://www.scopus.com/inward/record.url?scp=84861410182&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/TIT.2012.2190820

DO - https://doi.org/10.1109/TIT.2012.2190820

M3 - مقالة مرجعية

SN - 0018-9448

VL - 58

SP - 3419

EP - 3429

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

M1 - 6168835

ER -

Secret writing on dirty paper: A deterministic view

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this