Secure Communication Over Fading Channels

By Yingbin Liang, H. Vincent Poor, Shlomo Shamai. IEEE Transactions on Information Theory, 2007

966 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/8360a5189fa45b5981d7f3feeb4dc895df666071

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming (2007, background): “Fading and parallel channels were examined together in [31] and [32].”
Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond (2021, background): “There is an abundance of communication-only PHY layer security approaches, ranging from secure beamforming, jamming, and artificial noise design, to cooperative security designs [200], that could be adopted to address this challenge.”
Game Theory in Wireless and Communication Networks (2008, background): “There have been considerable efforts to generalize these studies to wireless-channel and multi-user scenarios (see [206, 289, 293, 357, 383, 440, 294, 172, 133] and references therein).”
Secure Multiterminal Source Coding With Side Information at the Eavesdropper (2011, neutral): “, for fading channels [29], arbitrary, i.”
Multiple-Access Channels With Confidential Messages (2008, background): “Communication of confidential messages has been studied in the literature for some classes of channels.”
Classifications and Applications of Physical Layer Security Techniques for Confidentiality: A Comprehensive Survey (2019, background): “The related-information theoretical works in [30], [63], [64], and [72]–[76] assure that one can design an adaptive scheme that can attain perfect secrecy (in the weak sense) at a certain rate by adopting the transmission to the channel conditions of the legitimate user, assuming that the channel kn”
Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel (2010, background): “As a starting point, for Gaussian models in which the channel matrices of intended receiver and eavesdropper are square and diagonal, the results in [6]–[9], which consider secure transmission over fading channels, can be applied.”
Communication Requirement for Reliable and Secure State Estimation and Control in Smart Grid (2011, background): “Recent years witnessed the resurrection of the information theoretic study on security issues, like channel capacity requirements for secure transmission in fading channels [5], [6], multiple access channels [17], broadcast channels [7], [8] and inter-”
On Cooperative Relaying Schemes for Wireless Physical Layer Security (2010, background): “There had also been some recent work focusing on secrecy rates based on partial channel state information (CSI), or based on channel statistics [4], [5].”
Compound Wiretap Channels (2009, neutral): “The converse follows from [12, Theorem 2] by setting R 0 = 0 for each eavesdropper.”
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey (2010, neutral): “parallel independent subchannels, was considered in [81]”
Secure Transmission With Artificial Noise Over Fading Channels: Achievable Rate and Optimal Power Allocation (2010, background): “The authors in [9] studied a fading broadcast channel with conﬁdential information intended only for one receiver and derived the optimal power allocation that minimizes the secrecy outage probability.”