Secure degrees of freedom of the Gaussian multiple access wiretap channel

We show that the sum secure degrees of freedom (d.o.f.) of the K-user Gaussian multiple access (MAC) wiretap channel is K(K-1)/K(K-1)+1. Our achievability is based on real interference alignment and structured cooperative jamming. Each user divides its message into K - 1 sub-messages, and sends a linear combination of signals carrying these sub-messages together with a structured cooperative jamming signal. All cooperative jamming signals are aligned in a single dimension at the legitimate receiver allowing for reliable decoding of the message carrying signals by the legitimate receiver. Each cooperative jamming signal is aligned with K-1 message signals at the eavesdropper limiting the information leakage rate to the eavesdropper. We provide a matching converse establishing the exact sum secure d.o.f. of the Gaussian MAC wiretap channel as K(K-1)/K(K-1)+1.

[1]  E. Tekin,et al.  On Secure Signaling for the Gaussian Multiple Access Wire-tap Channel , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[2]  Sennur Ulukus,et al.  Cooperative Secrecy in Wireless Communications , 2009 .

[3]  Ruoheng Liu,et al.  Securing Wireless Communications at the Physical Layer , 2014 .

[4]  Xiang He,et al.  Cooperation and information theoretic security in wireless networks. , 2011 .

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

[6]  Raef Bassily,et al.  Ergodic Secret Alignment , 2010, IEEE Transactions on Information Theory.

[7]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[8]  Ender Tekin,et al.  The Gaussian Multiple Access Wire-Tap Channel , 2006, IEEE Transactions on Information Theory.

[9]  Jianwei Xie,et al.  Secure degrees of freedom of the Gaussian wiretap channel with helpers , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Amir K. Khandani,et al.  On the Secure Degrees-of-Freedom of the Multiple-Access-Channel , 2010, ArXiv.

[11]  Ender Tekin,et al.  The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.

[12]  S. Ulukus,et al.  On the secrecy of multiple access wiretap channel , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[13]  Ender Tekin,et al.  Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy , 2006, ArXiv.

[14]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[15]  Aylin Yener,et al.  Providing Secrecy With Structured Codes: Tools and Applications to Two-User Gaussian Channels , 2009, ArXiv.

[16]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[17]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[18]  Sennur Ulukus,et al.  Chapter 7 Cooperative Secrecy in Wireless Communications , 2010 .

[19]  Amir K. Khandani,et al.  Real Interference Alignment with Real Numbers , 2009, ArXiv.