Degraded Compound Multi-Receiver Wiretap Channels

被引:29
作者
Ekrem, Ersen [1 ]
Ulukus, Sennur [1 ]
机构
[1] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
Compound wiretap channels; Gaussian multiple-input multiple-output (MIMO) compound wiretap channels; secrecy capacity region; SHARING COMMUNICATION-SYSTEMS; CAPACITY REGION; CODING THEOREM; INEQUALITY;
D O I
10.1109/TIT.2012.2204490
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study the degraded compound multi-receiver wiretap channel (DCMRWC). DCMRWC consists of two groups of users and a group of eavesdroppers, where, if we pick an arbitrary user from each group of users and an arbitrary eavesdropper, they satisfy a certain Markov chain. We study two different communication scenarios for this channel. In the first scenario, the transmitter wants to send a confidential message to users in the first (stronger) group and a different confidential message to users in the second (weaker) group, where both messages need to be kept confidential from the eavesdroppers. For this scenario, we assume that there is only one eavesdropper. We obtain the secrecy capacity region for the discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian multiple-input multiple-output (MIMO) channel model, we obtain the secrecy capacity region when there is only one user in the second group. In the second scenario we study, the transmitter sends a confidential message to users in the first group which needs to be kept confidential from the second group of users and the eavesdroppers. Moreover, the transmitter sends a different confidential message to users in the second group which needs to be kept confidential only from the eavesdroppers. For this scenario, we do not put any restriction on the number of eavesdroppers. As in the first scenario, we obtain the secrecy capacity region for the discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian MIMO channel model, we establish the secrecy capacity region when there is only one user in the second group.
引用
收藏
页码:5681 / 5698
页数:18
相关论文
共 23 条
[1]  
BAGHERIKARAM G, 2008, 46 ANN ALL C COMM CO
[2]  
Bagherikaram G., 2009, IEEE T INF THEORY
[3]   THE CONVOLUTION INEQUALITY FOR ENTROPY POWERS [J].
BLACHMAN, NM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (02) :267-271
[4]  
Chia Y.-K., 2009, IEEE INT S INF THEOR
[5]   A NEW ENTROPY POWER INEQUALITY [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (06) :751-760
[6]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[7]   The worst additive noise under a covariance constraint [J].
Diggavi, SN ;
Cover, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) :3072-3081
[8]  
EKREM E, 2008, 42 AS C SIGN SYST CO
[9]   The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel [J].
Ekrem, Ersen ;
Ulukus, Sennur .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) :2083-2114
[10]   Secrecy Capacity of a Class of Broadcast Channels with an Eavesdropper [J].
Ekrem, Ersen ;
Ulukus, Sennur .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2009,