Secure communication over fading channels

被引:644
作者
Liang, Yingbin [1 ]
Poor, H. Vincent [2 ]
Sharnai , Shlorno [3 ]
机构
[1] Univ Hawaii, Dept Elect Engn, Honolulu, HI 96822 USA
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[3] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
基金
美国国家科学基金会;
关键词
confidential message; ergodic capacity; fading broadcast channel; Gaussian broadcast channel; outage probability; parallel broadcast channel; power allocation; secrecy capacity;
D O I
10.1109/TIT.2008.921678
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established, which gives the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long-term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derived that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.
引用
收藏
页码:2470 / 2492
页数:23
相关论文
共 61 条
[1]   Common randomness in information theory and cryptography - Part II: CR capacity [J].
Ahlswede, R ;
Csiszar, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :225-240
[2]   COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING [J].
AHLSWEDE, R ;
CSISZAR, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1121-1132
[3]  
[Anonymous], P 45 ALL C COMM CONT
[4]  
[Anonymous], 2007, PROC 45 ANN ALLERTON
[5]   Secrecy capacity of wireless channels [J].
Barros, Joao ;
Rodrigues, Miguel R. D. .
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :356-+
[6]   Wireless information-theoretic security [J].
Bloch, Matthieu ;
Barros, Joao ;
Rodrigues, Miguel R. D. ;
McLaughlin, Steven W. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2515-2534
[7]   Optimum power control over fading channels [J].
Caire, G ;
Taricco, G ;
Biglieri, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) :1468-1489
[8]   NOTE ON WYNERS WIRETAP CHANNEL [J].
CARLEIAL, AB ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (03) :387-390
[9]  
Cohen G, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P46
[10]  
Cover TM, 2006, Elements of Information Theory