MIMO Gaussian broadcast channels with confidential and common messages

Ruoheng Liu; Tie Liu; H. Vincent Poor; Shlomo Shamai

doi:10.1109/ISIT.2010.5513775

MIMO Gaussian broadcast channels with confidential and common messages

Ruoheng Liu, Tie Liu, H. Vincent Poor, Shlomo Shamai

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

27 Scopus citations

Abstract

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the confidential messages is intended for one of the receivers but needs to be kept perfectly secret from the other, and the common message is intended for both receivers. It is shown that a natural scheme that combines secret dirty-paper coding with Gaussian superposition coding achieves the secrecy capacity region. To prove this result, a channel-enhancement approach and an extremal entropy inequality of Weingarten et al. are used.

Original language	English (US)
Title of host publication	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages	2578-2582
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2010.5513775
State	Published - 2010
Event	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: Jun 13 2010 → Jun 18 2010

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8103

Other

Other	2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/Territory	United States
City	Austin, TX
Period	6/13/10 → 6/18/10

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2010.5513775

Cite this

@inproceedings{6b7cc6822f8547f3a51f6217c4011c86,

title = "MIMO Gaussian broadcast channels with confidential and common messages",

abstract = "This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the confidential messages is intended for one of the receivers but needs to be kept perfectly secret from the other, and the common message is intended for both receivers. It is shown that a natural scheme that combines secret dirty-paper coding with Gaussian superposition coding achieves the secrecy capacity region. To prove this result, a channel-enhancement approach and an extremal entropy inequality of Weingarten et al. are used.",

author = "Ruoheng Liu and Tie Liu and Poor, {H. Vincent} and Shlomo Shamai",

year = "2010",

doi = "10.1109/ISIT.2010.5513775",

language = "English (US)",

isbn = "9781424469604",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2578--2582",

booktitle = "2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings",

note = "2010 IEEE International Symposium on Information Theory, ISIT 2010 ; Conference date: 13-06-2010 Through 18-06-2010",

}

Liu, R, Liu, T, Poor, HV & Shamai, S 2010, MIMO Gaussian broadcast channels with confidential and common messages. in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513775, IEEE International Symposium on Information Theory - Proceedings, pp. 2578-2582, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 6/13/10. https://doi.org/10.1109/ISIT.2010.5513775

MIMO Gaussian broadcast channels with confidential and common messages. / Liu, Ruoheng; Liu, Tie; Poor, H. Vincent et al.
2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 2578-2582 5513775 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - MIMO Gaussian broadcast channels with confidential and common messages

AU - Liu, Ruoheng

AU - Liu, Tie

AU - Poor, H. Vincent

AU - Shamai, Shlomo

PY - 2010

Y1 - 2010

N2 - This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the confidential messages is intended for one of the receivers but needs to be kept perfectly secret from the other, and the common message is intended for both receivers. It is shown that a natural scheme that combines secret dirty-paper coding with Gaussian superposition coding achieves the secrecy capacity region. To prove this result, a channel-enhancement approach and an extremal entropy inequality of Weingarten et al. are used.

AB - This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the confidential messages is intended for one of the receivers but needs to be kept perfectly secret from the other, and the common message is intended for both receivers. It is shown that a natural scheme that combines secret dirty-paper coding with Gaussian superposition coding achieves the secrecy capacity region. To prove this result, a channel-enhancement approach and an extremal entropy inequality of Weingarten et al. are used.

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

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

U2 - 10.1109/ISIT.2010.5513775

DO - 10.1109/ISIT.2010.5513775

M3 - Conference contribution

AN - SCOPUS:77955683763

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2578

EP - 2582

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010

Y2 - 13 June 2010 through 18 June 2010

ER -

MIMO Gaussian broadcast channels with confidential and common messages

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this