Secrecy in the two-way untrusted relay channel with compute-and-forward

We consider the problem of secure communications in a Gaussian two-way relay channel applying the compute-and-forward scheme using nested lattice codes. Two nodes employ half-duplex operation and can exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We provide an achievable secrecy rate region under a weak secrecy criterion and provide the proof. We show that the achievable sum secrecy rate is equivalent to the difference between the computation rate and the multiple access channel (MAC) capacity. Particularly, we show that both the nodes must encode their messages such that the common computation rate pair falls outside the MAC capacity region of the relay.

[1]  Wen Chen,et al.  Compute-and-Forward Network Coding Design over Multi-Source Multi-Relay Channels , 2012, IEEE Transactions on Wireless Communications.

[2]  Ender Tekin,et al.  Correction to: "the Gaussian multiple access wire-tap channel" and "the general Gaussian multiple access and two-way wire-tap channels: achievable rates and cooperative jamming" , 2010, IEEE Trans. Inf. Theory.

[3]  Eduard A. Jorswieck,et al.  Physical layer security vs. network layer secrecy: Who wins on the untrusted two-way relay channel? , 2013, 2013 IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD).

[4]  Jean-Claude Belfiore.  Lattice codes for the compute-and-forward protocol: The flatness factor , 2011, 2011 IEEE Information Theory Workshop.

[5]  Eduard A. Jorswieck,et al.  An efficient branch-and-bound algorithm for compute-and-forward , 2012, 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC).

[6]  R. Zamir.  Lattices are everywhere , 2009, 2009 Information Theory and Applications Workshop.

[7]  Aylin Yener,et al.  Providing Secrecy With Structured Codes: Two-User Gaussian Channels , 2014, IEEE Transactions on Information Theory.

[8]  Cong Ling,et al.  Achievable Rates for Lattice Coded Gaussian Wiretap Channels , 2011, 2011 IEEE International Conference on Communications Workshops (ICC).

[9]  Cong Ling,et al.  Semantically Secure Lattice Codes for the Gaussian Wiretap Channel , 2012, IEEE Transactions on Information Theory.

[10]  Michael Gastpar,et al.  Reliable Physical Layer Network Coding , 2011, Proceedings of the IEEE.

[11]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[12]  Soung Chang Liew,et al.  Hot topic: physical-layer network coding , 2006, MobiCom '06.

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

[14]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[15]  Cong Ling,et al.  Lattice codes achieving strong secrecy over the mod-Λ Gaussian Channel , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[18]  Tobias J. Oechtering,et al.  Broadcast Capacity Region of Two-Phase Bidirectional Relaying , 2007, IEEE Transactions on Information Theory.

[19]  Aylin Yener,et al.  Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay , 2013, IEEE Transactions on Information Theory.

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

[21]  Shashank Vatedka,et al.  Secure Compute-and-Forward in a Bidirectional Relay , 2012, IEEE Transactions on Information Theory.

[22]  Simon Litsyn,et al.  Lattices which are good for (almost) everything , 2005, IEEE Transactions on Information Theory.

[23]  Thomas C. Hales.  Sphere packings, I , 1997, Discret. Comput. Geom..

[24]  Frédérique E. Oggier,et al.  Secrecy gain: A wiretap lattice code design , 2010, 2010 International Symposium On Information Theory & Its Applications.

[25]  Alexandre J. Pierrot,et al.  Strongly Secure Communications Over the Two-Way Wiretap Channel , 2010, IEEE Transactions on Information Forensics and Security.

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

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

[28]  Jean-Claude Belfiore,et al.  Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis , 2011, IEEE Transactions on Information Theory.