MIMO gaussian broadcast channels with confidential messages

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

doi:10.1109/ISIT.2009.5205827

MIMO gaussian broadcast channels with confidential messages

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

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

11 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 messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (a prefix channel) and random binning.

Original language	English (US)
Title of host publication	2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages	2757-2761
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2009.5205827
State	Published - 2009
Event	2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of Duration: Jun 28 2009 → Jul 3 2009

Publication series

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

Other

Other	2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/Territory	Korea, Republic of
City	Seoul
Period	6/28/09 → 7/3/09

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2009.5205827

Cite this

@inproceedings{da119b7b6da0462b8be5c9d9ba426931,

title = "MIMO gaussian broadcast channels with confidential 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 messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (a prefix channel) and random binning.",

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

year = "2009",

doi = "10.1109/ISIT.2009.5205827",

language = "English (US)",

isbn = "9781424443130",

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

pages = "2757--2761",

booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

note = "2009 IEEE International Symposium on Information Theory, ISIT 2009 ; Conference date: 28-06-2009 Through 03-07-2009",

}

Liu, R, Liu, T, Poor, HV & Shamai, S 2009, MIMO gaussian broadcast channels with confidential messages. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5205827, IEEE International Symposium on Information Theory - Proceedings, pp. 2757-2761, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5205827

TY - GEN

T1 - MIMO gaussian broadcast channels with confidential messages

AU - Liu, Ruoheng

AU - Liu, Tie

AU - Poor, H. Vincent

AU - Shamai, Shlomo

PY - 2009

Y1 - 2009

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 messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (a prefix channel) and random binning.

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 messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (a prefix channel) and random binning.

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

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

U2 - 10.1109/ISIT.2009.5205827

DO - 10.1109/ISIT.2009.5205827

M3 - Conference contribution

AN - SCOPUS:70449472879

SN - 9781424443130

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2757

EP - 2761

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

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

Y2 - 28 June 2009 through 3 July 2009

ER -

MIMO gaussian broadcast channels with confidential messages

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this