On Secrecy Capacity of Fast Fading Multiple-Input Wiretap Channels With Statistical CSIT

We consider the secure transmission in ergodic fast Rayleigh fading multiple-input single-output single-antenna-eavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels are the only available channel state information at the transmitter (CSIT). By introducing a new secrecy capacity upper bound, we prove that the secrecy capacity is achieved by the Gaussian input without prefixing. To attain this result, we form another MISOSE channel for upper-bounding by relaxing the equivocation constraint, and tighten the bound by carefully selecting correlations between the legitimate and eavesdropper channel gains. The resulting upper bound is tighter than the others in the literature which are based on modifying the correlation between the noises at the legitimate receiver and eavesdropper. Next, we fully characterize the secrecy capacity by showing that the optimal channel input covariance matrix is a scaled identity matrix. The key to solve such a stochastic optimization problem is by exploiting the completely monotone property of the secrecy capacity. Finally, we prove that with only statistical CSIT of both channels, the capacity will neither scale with signal-to-noise ratio (SNR) nor the number of antenna. Our numerical results also match these observations and further confirm that having the legitimate CSIT (realizations) is very beneficial to increase the secrecy capacity.

[1]  R. Stephenson A and V , 1962, The British journal of ophthalmology.

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

[3]  Rohit Negi,et al.  Guaranteeing Secrecy using Artificial Noise , 2008, IEEE Transactions on Wireless Communications.

[4]  Elza Erkip,et al.  Diversity-multiplexing tradeoff for the multiple-antenna wire-tap channel , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[5]  Carles Padró,et al.  Information Theoretic Security , 2013, Lecture Notes in Computer Science.

[6]  Ingram Olkin,et al.  Inequalities: Theory of Majorization and Its Application , 1979 .

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

[8]  A. M. Mathai Quadratic forms in random variables , 1992 .

[9]  Shlomo Shamai,et al.  On the capacity of some channels with channel state information , 1999, IEEE Trans. Inf. Theory.

[10]  Mohamed-Slim Alouini,et al.  On the ergodic secrecy capacity of the wiretap channel under imperfect main channel estimation , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[11]  Zouheir Rezki,et al.  The Ergodic Capacity of The MIMO Wire-Tap Channel , 2009, ArXiv.

[12]  Athina P. Petropulu,et al.  On Ergodic Secrecy Rate for Gaussian MISO Wiretap Channels , 2011, IEEE Transactions on Wireless Communications.

[13]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[14]  Frédérique E. Oggier,et al.  The secrecy capacity of the MIMO wiretap channel , 2007, 2008 IEEE International Symposium on Information Theory.

[15]  Shlomo Shamai,et al.  A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel , 2007, IEEE Transactions on Information Theory.

[16]  Gregory W. Wornell,et al.  Secure Transmission With Multiple Antennas I: The MISOME Wiretap Channel , 2010, IEEE Transactions on Information Theory.

[17]  Wade Trappe,et al.  Achieving Secret Communication for Fast Rayleigh Fading Channels , 2010, IEEE Transactions on Wireless Communications.

[18]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

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

[20]  Stochastic Orders , 2008 .

[21]  J. Norris Appendix: probability and measure , 1997 .

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