The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel

被引:155
作者
Ekrem, Ersen [1 ]
Ulukus, Sennur [1 ]
机构
[1] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
关键词
Gaussian MIMO broadcast channel; information theoretic security; secrecy capacity region; BROADCAST CHANNELS; MUTUAL INFORMATION; INEQUALITY; ACCESS;
D O I
10.1109/TIT.2011.2111750
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external eavesdropper. We derive the secrecy capacity region of this channel for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques for the Gaussian scalar broadcast channel cannot be extended to this secrecy context, to emphasize the need for a new proof technique. Our new proof technique makes use of the relationships between the minimum-mean-square-error and the mutual information, and equivalently, the relationships between the Fisher information and the differential entropy. Using the intuition gained from the converse proof of the SISO channel, we first prove the secrecy capacity region of the degraded MIMO channel, in which all receivers have the same number of antennas, and the noise covariance matrices can be arranged according to a positive semi-definite order. We then generalize this result to the aligned case, in which all receivers have the same number of antennas; however, there is no order among the noise covariance matrices. We accomplish this task by using the channel enhancement technique. Finally, we find the secrecy capacity region of the general MIMO channel by using some limiting arguments on the secrecy capacity region of the aligned MIMO channel. We show that the capacity achieving coding scheme is a variant of dirty-paper coding with Gaussian signals.
引用
收藏
页码:2083 / 2114
页数:32
相关论文
共 46 条
[1]  
[Anonymous], 41 ANN C INF SCI SYS
[2]  
[Anonymous], IEEE T INF IN PRESS
[3]  
BAGHERIKARAM G, 2008, 46 ANN ALL C COMM CO
[4]   SIMPLE CONVERSE FOR BROADCAST CHANNELS WITH ADDITIVE WHITE GAUSSIAN NOISE [J].
BERGMANS, PP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :279-280
[5]   THE CONVOLUTION INEQUALITY FOR ENTROPY POWERS [J].
BLACHMAN, NM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (02) :267-271
[6]  
Bloch M., 2008, IEEE INF THEOR WORKS
[7]   A NEW ENTROPY POWER INEQUALITY [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (06) :751-760
[8]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[9]   The worst additive noise under a covariance constraint [J].
Diggavi, SN ;
Cover, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) :3072-3081
[10]  
Ekrem E., 2008, C INF SCI SYST MAR