The secrecy capacity of the MIMO wiretap channel

By Frédérique E. Oggier, Babak Hassibi. 2008 IEEE International Symposium on Information Theory, 2007

1,106 citations recorded by the source corpus.

We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits of information. In this paper, we compute the perfect secrecy capacity of the multiple antenna MIMO broadcast channel, where the number of antennas is arbitrary for both the transmitter and the two receivers. Our technique involves a careful study of a Sato-like upper bound via the solution of a certain algebraic Riccati equation.

Subfields: Applied Mathematics, Computer Vision and Pattern Recognition, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/699bee9cebc1a6bd4f6fe4512a0612e6a081f494

How researchers see this paper

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

In Applied Mathematics

In Computer Vision and Pattern Recognition

In Electrical and Electronic Engineering

Citations in the corpus

Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel (2010, methodology): “Subsequently, this minimax upper bound was shown to be tight for the MIMOME case in [19] and, independently, [20] (see also [21]).”
Secure Transmission With Artificial Noise Over Fading Channels: Achievable Rate and Optimal Power Allocation (2010, background): “Many works have been devoted to analyzing the secrecy capacity with various antenna conﬁgurations and channel conditions, e.g., [3–6].”
On the Secrecy Capacity of Fading Channels (2006, background): “Also, the role of multiple antennas is studied in [19], [ 20 ].”
Classifications and Applications of Physical Layer Security Techniques for Confidentiality: A Comprehensive Survey (2019, methodology): “on characterizing the achievable secrecy capacity of multiantenna systems performed in [95]–[97], as shown in Fig.”
A Note on the Secrecy Capacity of the Multi-antenna Wiretap Channel (2007, methodology): “(The same approach was also followed by Shaﬁee et al. [8] and Oggier and Hassibi [9] to characterize the secrecy capacity of the 2 × 2 × 1 and the general multi-antenna wiretap channel, respectively.)”
Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel (2010, background): “The minimax upper bounding approach in [19], [20] provides a computable characterization for the capacity expression and identiﬁes a hidden convexity in optimizing the Csisz´ar-K¨orner expression with Gaussian inputs, whereas the channel enhancement approach does not.”
Towards the Secrecy Capacity of the Gaussian MIMO Wire-Tap Channel: The 2-2-1 Channel (2007, background): “Shortly after the submission of this work, the secrecy capacity of the general Gaussian MIMO wiretap channel has been found by exploring the properties of the saddle point of the upper bound [27], [28].”
Improving Wireless Physical Layer Security via Cooperating Relays (2010, background): “In particular, for the case of one eavesdropper, an achievable secrecy rate is [6], [8], [9]”
QoS-Based Transmit Beamforming in the Presence of Eavesdroppers: An Optimized Artificial-Noise-Aided Approach (2011, background): “The MIMO secrecy capacity problems are considered in [18]–[21]; see also [22] for fast fading channels.”
Cooperative Jamming for Secure Communications in MIMO Relay Networks (2011, background): “A two-stage cooperative jamming protocol is investigated in [14], where multiple relay nodes act as an extension of the single-antenna source node.”