Secret-Key Agreement Over Non-Coherent Block-Fading Channels With Public Discussion

Motivated by recent interest in physical-layer secret-key generation over wireless fading channels, we study the non-coherent secret-key generation capacity of a block-fading wireless channel with channel reciprocity and bi-directional (two-way) communication. We assume a non-coherent main channel, i.e., the realization of channel gains on the main channel is not known to any terminal. The eavesdropper is assumed to have both perfect Channel State Information of its own channel and orthogonal observations from the forward and backward channels. As our main result, we establish new upper and lower bounds on the secret-key generation capacity with public discussion, which are structurally similar. The upper bound can be expressed as a sum of three terms-one of the terms arises due to channel reciprocity, while the other two terms correspond to communication on the forward and backward channels, respectively. In the limit of long coherence period, the contribution from channel reciprocity vanishes to zero, whereas the other terms prevail. The lower bound is based on a separation based scheme. In each coherence block, we use the first symbol for training while the remainder of the coherence block is devoted to source emulation, i.e., to generate correlated sources between the terminals. The lower bound expression also consists of three terms and admits an interpretation similar to the upper bound expression. For Rayleigh fading channels, in the high signal-to-noise ratio (SNR) regime, the gap between the upper and lower bounds is shown to vanish inversely with the coherence period. Numerical results indicate significant performance gains over training-only schemes even for moderate values of SNR and small coherence periods.

[1]  Vinod M. Prabhakaran,et al.  On interactive message secrecy over erasure networks , 2012 .

[2]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

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

[4]  Raymond Knopp,et al.  Relative channel reciprocity calibration in MIMO/TDD systems , 2010, 2010 Future Network & Mobile Summit.

[5]  Suhas N. Diggavi,et al.  On interactive secrecy over erasure networks , 2012, 2012 5th International Symposium on Communications, Control and Signal Processing.

[6]  Imre Csiszár,et al.  Secrecy capacities for multiple terminals , 2004, IEEE Transactions on Information Theory.

[7]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[8]  Suhas N. Diggavi,et al.  Secret-Key Agreement With Channel State Information at the Transmitter , 2010, IEEE Transactions on Information Forensics and Security.

[9]  Akbar Rahman,et al.  Exploiting the physical layer for enhanced security [Security and Privacy in Emerging Wireless Networks] , 2010, IEEE Wireless Communications.

[10]  Mohamed-Slim Alouini,et al.  Noncoherent Capacity of Secret-Key Agreement With Public Discussion , 2011, IEEE Transactions on Information Forensics and Security.

[11]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[12]  Suhas N. Diggavi,et al.  Creating shared secrets out of thin air , 2012, HotNets-XI.

[13]  Umer Salim,et al.  Combining Training and Quantized Feedback in Multiantenna Reciprocal Channels , 2009, IEEE Transactions on Signal Processing.

[14]  Stark C. Draper,et al.  Exploiting Channel Diversity in Secret Key Generation From Multipath Fading Randomness , 2011, IEEE Transactions on Information Forensics and Security.

[15]  Suhas N. Diggavi,et al.  A remark on secret-key generation over correlated fading channels , 2011, 2011 IEEE GLOBECOM Workshops (GC Wkshps).

[16]  Lizhong Zheng,et al.  Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel , 2002, IEEE Trans. Inf. Theory.

[17]  Matthieu Bloch,et al.  Secret Sharing over Fast-Fading MIMO Wiretap Channels , 2009, EURASIP J. Wirel. Commun. Netw..

[18]  Ness B. Shroff,et al.  Joint Power and Secret Key Queue Management for Delay Limited Secure Communication , 2010, 2010 Proceedings IEEE INFOCOM.

[19]  H. Vincent Poor,et al.  A Unified Framework for Key Agreement Over Wireless Fading Channels , 2009, IEEE Transactions on Information Forensics and Security.

[20]  Stark C. Draper,et al.  Key Generation Using External Source Excitation: Capacity, Reliability, and Secrecy Exponent , 2012, IEEE Transactions on Information Theory.

[21]  Senay Haile Investigation of Channel Reciprocity for OFDM TDD Systems , 2009 .

[22]  Mudhakar Srivatsa,et al.  Limitations of Generating a Secret Key Using Wireless Fading Under Active Adversary , 2012, IEEE/ACM Transactions on Networking.

[23]  Shlomo Shamai,et al.  Secret Writing on Dirty Paper: A Deterministic View , 2012, IEEE Transactions on Information Theory.

[24]  Shun Watanabe,et al.  Secret key agreement from vector Gaussian sources by rate limited public communication , 2010, 2010 IEEE International Symposium on Information Theory.

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

[26]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[27]  Suhas N. Diggavi,et al.  Secret-Key Generation Using Correlated Sources and Channels , 2009, IEEE Transactions on Information Theory.

[28]  Vinod M. Prabhakaran,et al.  Secrecy via Sources and Channels , 2008, IEEE Transactions on Information Theory.

[29]  Sirin Nitinawarat Secret key generation for correlated Gaussian sources , 2008, 2008 IEEE International Symposium on Information Theory.

[30]  Ashish Khisti Interactive secret key generation over reciprocal fading channels , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[31]  Prasant Mohapatra,et al.  Adaptive wireless channel probing for shared key generation , 2011, 2011 Proceedings IEEE INFOCOM.

[32]  Lizhong Zheng,et al.  Wideband Fading Channels With Feedback , 2010, IEEE Transactions on Information Theory.

[33]  David Tse,et al.  Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels , 2007, IEEE Transactions on Information Forensics and Security.

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

[35]  Ness B. Shroff,et al.  Secrecy outage capacity of fading channels , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[36]  Fei Teng,et al.  Bidirectional channel estimation using adaptive pilots , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[37]  Amos Lapidoth,et al.  Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels , 2003, IEEE Trans. Inf. Theory.

[38]  Shun Watanabe,et al.  Secret Key Agreement from Correlated Gaussian Sources by Rate Limited Public Communication , 2010, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[39]  Mikael Skoglund,et al.  Secure key agreement over reciprocal fading channels in the low SNR regime , 2013, 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC).