On the Achievable Secrecy Throughput of Block Fading Channels with No Channel State Information at Transmitter

We study the block fading wire-tap channel, where a transmitter sends confidential messages to a legitimate receiver over a block fading channel in the presence of an eavesdropper, which listens to the transmission through another independent block fading channel. We assume that the transmitter has no channel state information (CSI) available from either the main channel or the eavesdropper channel. The transmitter uses an in advance given Wyner secrecy code (instead of adapting the code based on CSI). In this case, both reliability and perfect secrecy can be achieved only for a subset of channel states. We identify this channel state set and provide an achievable average secrecy throughput of the block fading wire-tap channel for given reliability and secrecy outage probabilities.

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

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

[3]  Miguel R. D. Rodrigues,et al.  Secrecy Capacity of Wireless Channels , 2006, 2006 IEEE International Symposium on Information Theory.

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

[5]  Roy D. Yates,et al.  Secrecy capacity of independent parallel channels , 2009 .

[6]  H. Vincent Poor,et al.  Generalized Multiple Access Channels with Confidential Messages , 2006, 2006 IEEE International Symposium on Information Theory.

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

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

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

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

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

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

[13]  Roy D. Yates,et al.  The Discrete Memoryless Multiple Access Channel with Confidential Messages , 2006, 2006 IEEE International Symposium on Information Theory.