MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States

被引:52
作者
He, Xiang [1 ]
Yener, Aylin [1 ]
机构
[1] Penn State Univ, Dept Elect Engn, University Pk, PA 16802 USA
基金
美国国家科学基金会;
关键词
Information theoretic secrecy; MIMO wiretap channel; MIMO MAC wiretap channel; MIMO BC wiretap channel; strong secrecy; eavesdroppers with unknown and varying channel gains; GAUSSIAN MULTIPLE-ACCESS; SECRECY CAPACITY REGION; BROADCAST CHANNELS; INTERFERENCE;
D O I
10.1109/TIT.2014.2359192
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel state is completely unknown to the legitimate parties. In particular, a Gaussian MIMO wiretap channel is considered, where the eavesdropper channel state can vary from one channel use to the next, and the overall channel state sequence is known only to the eavesdropper. When the eavesdropper has fewer antennas than the transmitter and its intended receiver, a positive secrecy rate in the sense of strong secrecy is proved to be achievable and shown to match with the converse in secure degrees of freedom. This yields the conclusion that secure communication is possible regardless of the location or channel states of the eavesdropper. Additionally, it is observed that, the present setting renders the secrecy capacity problems for some multiterminal wiretap-type channels more tractable as compared to the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access (MAC) wiretap channel and the two-user Gaussian MIMO broadcast (BC) wiretap channel, where the transmitter(s) and intended receiver(s) have the same number of antennas.
引用
收藏
页码:6844 / 6869
页数:26
相关论文
共 47 条
[1]   ELIMINATION OF CORRELATION IN RANDOM CODES FOR ARBITRARILY VARYING CHANNELS [J].
AHLSWEDE, R .
ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1978, 44 (02) :159-175
[2]  
[Anonymous], 2006, Elements of Information Theory
[3]  
[Anonymous], 2009, American Mathematical Soc.
[4]  
[Anonymous], 1996, PROBLEMY PEREDACHI I
[5]   On the Secure DoF of the Single-Antenna MAC [J].
Bagherikaram, Ghadamali ;
Motahari, Abolfazl S. ;
Khandani, Amir K. .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :2588-2592
[6]   THE CAPACITY OF A CLASS OF CHANNELS [J].
BLACKWELL, D ;
BREIMAN, L ;
THOMASIAN, AJ .
ANNALS OF MATHEMATICAL STATISTICS, 1959, 30 (04) :1229-1241
[7]  
Bloch M. R., 2011, CORR
[8]  
Bloch M, 2009, 2009 INFORMATION THEORY AND APPLICATIONS WORKSHOP, P20
[9]   On the Secrecy Capacity of Arbitrary Wiretap Channels [J].
Bloch, Matthieu ;
Laneman, J. Nicholas .
2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, :818-825
[10]   Secure network coding [J].
Cai, N ;
Yeung, RW .
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :323-323