Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2011 | Submitted
Journal Article Open

The Secrecy Capacity of the MIMO Wiretap Channel

Abstract

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.

Additional Information

© 2011 IEEE. Manuscript received July 19, 2008; revised September 25, 2010; accepted March 18, 2011. Date of current version July 29, 2011. This work was done while F. Oggier was with the Department of Electrical Engineering, California Institute of Technology, Pasadena. This work was supported in part by NSF Grant CCF-0729203, in part by Caltech's Lee Center for Advanced Networking, and in part by a grant from the David and Lucille Packard Foundation. Part of this work appeared at the 45th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, July 2007, and the IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 2008. The authors would like to thank Prof. S. Shamai for pointing out an argument which simplified one of the proofs and the anonymous reviewers for their careful reading of the paper.

Attached Files

Submitted - The_20Secrecy_20Capacity_20of_20the_20MIMO_20Wiretap_20Channel.pdf

Files

The_20Secrecy_20Capacity_20of_20the_20MIMO_20Wiretap_20Channel.pdf
Files (209.4 kB)

Additional details

Created:
August 22, 2023
Modified:
March 5, 2024