Secure Communication over Fading Channels
Authors:
- Yingbin LiangYLYingbin Liang
- H. Vincent PoorHPH. Vincent Poor
- Shlomo ShamaiShlomo Shamai
Preprint
Abstract
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. This result is then specialized to give 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. Both the ergodic and outage performances are studied.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Protocols for Secret Key Agreement by Public Discussion Based on Common Information2001
- Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacityIEEE Transactions on Information Theory, 2001
- Common randomness and secret key generation with a helperIEEE Transactions on Information Theory, 2000
- The common randomness capacity of a network of discrete memoryless channelsIEEE Transactions on Information Theory, 2000
- Common randomness in information theory and cryptography. II. CR capacityIEEE Transactions on Information Theory, 1998
- The common randomness capacity of a pair of independent discrete memoryless channelsIEEE Transactions on Information Theory, 1998
- On a special class of broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1997
- Common randomness in information theory and cryptography. I. Secret sharingIEEE Transactions on Information Theory, 1993
- A coding theorem for secret sharing communication systems with two Gaussian wiretap channelsIEEE Transactions on Information Theory, 1991
- Coding theorem for secret sharing communication systems with two noisy channelsIEEE Transactions on Information Theory, 1989