Secrecy Sum-Rates for the Multiple-Access WireTap Channel with Ergodic Block Fading

We consider a two-user multiple-access wiretap channel that undergoes ergodic block fading. In this scenario, there are two users are communicating with a base station in the presence of an eavesdropper, who has access to the communications through a multiple-access channel. We assume independent fading for each block, and that the fading process is ergodic. We also assume that the channel gains are measured accurately and are available to each transmitter and the eavesdropper in advance. We find the sum-rate maximizing power allocations for this case, and compare this to the instantaneous power control sum-rate. We also give a numerical solution when we incorporate cooperative jamming, where a user is allowed to use part of its power to jam the eavesdropper. In addition, we present an outer bound to the general multiple-access wire-tap channel, which is shown to be tight only for the degraded case.

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

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

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

[4]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[5]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[6]  Ueli Maurer,et al.  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.

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

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

[9]  Ender Tekin,et al.  The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints , 2006, 2006 IEEE International Symposium on Information Theory.

[10]  Hesham El Gamal,et al.  On the Secrecy Capacity of Fading Channels , 2006, 2007 IEEE International Symposium on Information Theory.

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

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

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