Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel

By Ashish J. Khisti, Gregory W. Wornell. arXiv.org, 2010

461 citations recorded by the source corpus.

The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable characterization of the secrecy capacity is established as the saddle point solution to a minimax problem. The converse is based on a Sato-type argument used in other broadcast settings, and the coding theorem is based on Gaussian wiretap codebooks. At high signal-to-noise ratio (SNR), the secrecy capacity is shown to be attained by simultaneously diagonalizing the channel matrices via the generalized singular value decomposition, and independently coding across the resulting parallel channels. The associated capacity is expressed in terms of the corresponding generalized singular values. It is shown that a semi-blind "masked" multi-input multi-output (MIMO) transmission strategy that sends information along directions in which there is gain to the intended receiver, and synthetic noise along directions in which there is not, can be arbitrarily far from capacity in this regime. Necessary and sufficient conditions for the secrecy capacity to be zero are provided, which simplify in the limit of many antennas when the entries of the channel matrices are independent and identically distributed. The resulting scaling laws establish that to prevent secure communication, the eavesdropper needs three times as many antennas as the sender and intended receiver have jointly, and that the optimum division of antennas between sender and intended receiver is in the ratio of 2:1.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/7a121a2d25bb41b75a97f7168a013c20c36cf6f0

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

  1. Qiang Li
  2. Wing-Kin Ma
  3. Kai‐Kit Wong
  4. Aylin Yener
  5. Rui Zhang
  6. Ashish J. Khisti
  7. Ender Tekin
  8. Gregory W. Wornell

In Electrical and Electronic Engineering

  1. Rui Zhang
  2. Qiang Li
  3. Aylin Yener
  4. Wing-Kin Ma
  5. Kai‐Kit Wong
  6. Guangchi Zhang
  7. Miao Cui
  8. Gan Zheng

In Molecular Biology

  1. Aylin Yener
  2. Wing-Kin Ma
  3. Ender Tekin
  4. Qiang Li
  5. Ashish J. Khisti
  6. Gregory W. Wornell
  7. Gan Zheng
  8. Kai‐Kit Wong

Citations in the corpus