Secure Degrees of Freedom for Gaussian Channels with Interference: Structured Codes Outperform Gaussian Signaling

In this work, we prove that a positive secure degree of freedom is achievable for a large class of real Gaussian channels as long as the channel is not degraded and the channel is fully connected. This class includes the MAC wiretap channel, the 2-user interference channel with confidential messages, the 2-user interference channel with an external eavesdropper. Best known achievable schemes to date for these channels use Gaussian signaling. In this work, we show that structured codes outperform Gaussian random codes at high SNR when channel gains are real numbers.

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

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

[3]  Erik Ordentlich,et al.  The Degrees-of-Freedom of the $K$-User Gaussian Interference Channel Is Discontinuous at Rational Channel Coefficients , 2009, IEEE Transactions on Information Theory.

[4]  Erik Ordentlich,et al.  On the Degrees-of-Freedom of the K-user Gaussian interference channel , 2009, 2009 IEEE International Symposium on Information Theory.

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

[6]  Nan Liu,et al.  The Capacity Region of a Class of Discrete Degraded Interference Channels , 2008, IEEE Transactions on Information Theory.

[7]  Roy D. Yates,et al.  Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions , 2007, IEEE Transactions on Information Theory.

[8]  Shlomo Shamai,et al.  Interference alignment on the deterministic channel and application to fully connected AWGN interference networks , 2008, 2008 IEEE Information Theory Workshop.

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

[10]  Roy D. Yates,et al.  Secrecy capacity region of a class of one-sided interference channel , 2008, 2008 IEEE International Symposium on Information Theory.

[11]  Aylin Yener,et al.  A new outer bound for the gaussian interference channel with confidential messages , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[12]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.

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

[14]  Aylin Yener,et al.  K-user interference channels: Achievable secrecy rate and degrees of freedom , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[15]  Shlomo Shamai,et al.  A layered lattice coding scheme for a class of three user Gaussian interference channels , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[16]  Aylin Yener,et al.  Providing secrecy with lattice codes , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[17]  H. Vincent Poor,et al.  The Gaussian wiretap channel with a helping interferer , 2008, 2008 IEEE International Symposium on Information Theory.

[18]  Michael Gastpar,et al.  The case for structured random codes in network capacity theorems , 2008, Eur. Trans. Telecommun..

[19]  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.

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