Robust transmission over wiretap channels with secret keys

The wiretap channel with secret keys models the problem of secure communication in the presence of a non-legitimate eavesdropper, where the transmitter and legitimate receiver share a secret key of finite rate. This communication scenario is studied for compound channels. An achievable strong secrecy rate is presented and a multi-letter upper bound is derived. For degraded compound wiretap channels with secret keys the strong secrecy capacity is established. Finally, the case of channel state information at the transmitter is discussed and the secrecy capacity is established for this case as well.

[1]  J. Wolfowitz.  Simultaneous channels , 1959 .

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

[3]  Holger Boche,et al.  Secrecy results for compound wiretap channels , 2011, Probl. Inf. Transm..

[4]  Ruoheng Liu,et al.  Securing Wireless Communications at the Physical Layer , 2014 .

[5]  Rafael F. Schaefer,et al.  The secrecy capacity of a compound MIMO Gaussian channel , 2013, 2013 IEEE Information Theory Workshop (ITW).

[6]  Matthieu R. Bloch,et al.  Strong Secrecy From Channel Resolvability , 2011, IEEE Transactions on Information Theory.

[7]  M. Fekete.  Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten , 1918 .

[8]  Lingyang Song,et al.  Physical Layer Security in Wireless Communications , 2013 .

[9]  Ashish Khisti,et al.  Interference Alignment for the Multiantenna Compound Wiretap Channel , 2010, IEEE Transactions on Information Theory.

[10]  Rudolf Ahlswede,et al.  General Theory of Information Transfer and Combinatorics (Lecture Notes in Computer Science) , 2007 .

[11]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[12]  Shlomo Shamai,et al.  Compound Wiretap Channels , 2009, EURASIP J. Wirel. Commun. Netw..

[13]  Sennur Ulukus,et al.  On Gaussian MIMO compound wiretap channels , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[14]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .

[15]  Massimo Franceschetti,et al.  Wiretap Channel With Secure Rate-Limited Feedback , 2009, IEEE Transactions on Information Theory.

[16]  Hirosuke Yamamoto,et al.  Rate-distortion theory for the Shannon cipher system , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[17]  Nan Liu,et al.  Wiretap channel with shared key , 2010, 2010 IEEE Information Theory Workshop.

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

[19]  Shlomo Shamai,et al.  Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.

[20]  Gerhard Kramer,et al.  Effective secrecy: Reliability, confusion and stealth , 2013, 2014 IEEE International Symposium on Information Theory.

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

[22]  Neri Merhav.  Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels , 2007, ISIT.

[23]  Holger Boche,et al.  Physical Layer Service Integration in Wireless Networks : Signal processing challenges , 2014, IEEE Signal Processing Magazine.

[24]  Rudolf Ahlswede,et al.  Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder , 2006, GTIT-C.

[25]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .

[26]  H. Vincent Poor,et al.  Secret communication with feedback , 2008, 2008 International Symposium on Information Theory and Its Applications.

[27]  Rudolf Ahlswede,et al.  General Theory of Information Transfer and Combinatorics , 2006, GTIT-C.

[28]  Rafael F. Schaefer,et al.  The compound secrecy capacity of a class of non-degraded MIMO Gaussian channels , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).