A secrecy game with an informed jammer relay

A four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is investigated when the jammer relay is causally given the source message. The source aims to increase the achievable secrecy rates, whereas the jammer relay aims to decrease it. To help the eavesdropper and to decrease achievable perfect secrecy rates, the jammer relay can use pure relaying and/or send interference to assist eavesdropping. The problem is formulated as a zero-sum game and the saddle point solutions are found. The results are compared to the case when the jammer relay is not informed about the source message.

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

[2]  A. Robert Calderbank,et al.  Secrecy capacity of a class of orthogonal relay eavesdropper channels , 2009 .

[3]  Elza Erkip,et al.  The Relay Channel with a Wire-tapper , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[4]  Sennur Ulukus,et al.  Secrecy in Cooperative Relay Broadcast Channels , 2008, IEEE Transactions on Information Theory.

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

[6]  R. Poovendran,et al.  Modeling node capture attacks in wireless sensor networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[7]  R. Srikant,et al.  Correlated Jamming on MIMO Gaussian Fading Channels , 2004, IEEE Trans. Inf. Theory.

[8]  Georgios B. Giannakis,et al.  Mutual Information Jammer-Relay Games , 2008, IEEE Trans. Inf. Forensics Secur..

[9]  Elza Erkip,et al.  A Secure Communication Game With a Relay Helping the Eavesdropper , 2009, IEEE Transactions on Information Forensics and Security.

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

[11]  Sennur Ulukus,et al.  Mutual Information Games in Multi-user Channels with Correlated Jamming , 2006, ArXiv.

[12]  Xiang He,et al.  On the Equivocation Region of Relay Channels with Orthogonal Components , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[13]  Suhas N. Diggavi,et al.  The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.

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

[15]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[16]  M. Yuksel,et al.  Secure Communication with a Relay Helping the Wire-tapper , 2007, 2007 IEEE Information Theory Workshop.

[17]  R. Srikant,et al.  Correlated jamming on MIMO Gaussian fading channels , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[18]  Andrew Thangaraj,et al.  Confidential messages to a cooperative relay , 2008, 2008 IEEE Information Theory Workshop.

[19]  Hesham El Gamal,et al.  The Relay–Eavesdropper Channel: Cooperation for Secrecy , 2006, IEEE Transactions on Information Theory.

[20]  Yasutada Oohama,et al.  Coding for relay channels with confidential messages , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[21]  A. Robert Calderbank,et al.  Secrecy Capacity of a Class of Orthogonal Relay Eavesdropper Channels , 2009, 2009 Information Theory and Applications Workshop.