On the MISO compound wiretap channel

We study the secure degrees of freedom (d.o.f.) of the MISO compound wiretap channel. The transmitter has M antennas, whereas the legitimate receiver and the eavesdropper each have one antenna and the channel vectors take one of finitely many values. If the number of states of either the legitimate receiver or the eavesdropper channel is less than M, then then we achieve full 1 d.o.f. If however the number of states of both the legitimate receiver and the eavesdropper channel are at-least equal to M, then we establish that the d.o.f. is strictly less than 1. Our upper bound is, to our knowledge, the first bound which is strictly tighter than the “pairwise upper bound”. Lower bounds that combine ideas based on time-sharing, noise transmission, signal alignment and multi-level coding schemes are also provided.

[1]  Sennur Ulukus,et al.  The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel , 2009, IEEE Transactions on Information Theory.

[2]  Shlomo Shamai,et al.  A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel , 2007, IEEE Transactions on Information Theory.

[3]  Ami Wiesel,et al.  On the Gaussian MIMO Wiretap Channel , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Gregory W. Wornell,et al.  Secure Broadcasting Over Fading Channels , 2008, IEEE Transactions on Information Theory.

[5]  Sennur Ulukus,et al.  Degraded Compound Multi-Receiver Wiretap Channels , 2009, IEEE Transactions on Information Theory.

[6]  Yingbin Liang,et al.  Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages , 2009, IEEE Transactions on Information Theory.

[7]  Hesham El Gamal,et al.  On the Secrecy Capacity of Fading Channels , 2007, ISIT.

[8]  Amir K. Khandani,et al.  Secrecy capacity region of Gaussian broadcast channel , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[9]  Gene H. Golub,et al.  Matrix computations , 1983 .

[10]  H. Vincent Poor,et al.  Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages , 2007, IEEE Transactions on Information Theory.

[11]  Gregory W. Wornell,et al.  Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel , 2010, IEEE Transactions on Information Theory.

[12]  Shlomo Shamai,et al.  Multiple-Input Multiple-Output Gaussian Broadcast Channels With Confidential Messages , 2009, IEEE Transactions on Information Theory.

[13]  Shlomo Shamai,et al.  Compound wire-tap channels , 2007 .

[14]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[15]  Nan Liu,et al.  Towards the Secrecy Capacity of the Gaussian MIMO Wire-Tap Channel: The 2-2-1 Channel , 2007, IEEE Transactions on Information Theory.

[16]  H. Vincent Poor,et al.  Interference Alignment for Secrecy , 2008, IEEE Transactions on Information Theory.

[17]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[18]  Aylin Yener,et al.  Secure Degrees of Freedom for Gaussian Channels with Interference: Structured Codes Outperform Gaussian Signaling , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[19]  Shlomo Shamai,et al.  Secure Communication Over Fading Channels , 2007, IEEE Transactions on Information Theory.

[20]  Gregory W. Wornell,et al.  Secure Transmission With Multiple Antennas I: The MISOME Wiretap Channel , 2010, IEEE Transactions on Information Theory.

[21]  Vinod M. Prabhakaran,et al.  The secrecy capacity of a class of parallel Gaussian compound wiretap channels , 2008, 2008 IEEE International Symposium on Information Theory.

[22]  Amir K. Khandani,et al.  On the secure DoF of the single-antenna MAC , 2010, 2010 IEEE International Symposium on Information Theory.

[23]  Suhas N. Diggavi,et al.  On Cooperative Wireless Network Secrecy , 2009, IEEE INFOCOM 2009.