Secret key generation from reciprocal spatially correlated MIMO channels

Secret key generation from reciprocal multi-antenna channels is an interesting alternative to cryptographic key management in wireless systems without infrastructure access. In this work, we study the secret key rate for the basic source model with a MIMO channel. First, we derive an expression for the secret key rate under spatial correlation modelled by the Kronecker model and with spatial precoding at both communication nodes. Next, we analyze the result for uncorrelated antennas to understand the optimal precoding for this special case, which is equal power allocation. Then, the impact of correlation is characterized using Majorization theory. Surprisingly for small SNR, spatial correlation increases the secret key rate. For high SNR, the maximum secret key rate is achieved for uncorrelated antennas. The results indicate that a solid system design for reciprocal MIMO key generation is required to establish the secret key rate gains.

[1]  Holger Boche,et al.  Majorization and Matrix-Monotone Functions in Wireless Communications , 2007, Found. Trends Commun. Inf. Theory.

[2]  Jon W. Wallace,et al.  Automatic Secret Keys From Reciprocal MIMO Wireless Channels: Measurement and Analysis , 2010, IEEE Transactions on Information Forensics and Security.

[3]  Chen-Nee Chuah,et al.  Capacity scaling in MIMO Wireless systems under correlated fading , 2002, IEEE Trans. Inf. Theory.

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

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

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

[7]  Peter A. Loeb,et al.  Uncorrelatedness and orthogonality for vector-valued processes , 2003 .

[8]  Imre Csiszár,et al.  Common randomness and secret key generation with a helper , 2000, IEEE Trans. Inf. Theory.

[9]  Matthieu R. Bloch,et al.  Wireless Information-Theoretic Security , 2008, IEEE Transactions on Information Theory.

[10]  Shun Watanabe,et al.  Secret Key Agreement From Vector Gaussian Sources by Rate Limited Public Communication , 2010, IEEE Transactions on Information Forensics and Security.

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

[12]  Alex Reznik,et al.  Extracting Secrecy from Jointly Gaussian Random Variables , 2006, 2006 IEEE International Symposium on Information Theory.

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

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

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

[16]  Matthieu R. Bloch,et al.  Semi-Blind Key-Agreement over MIMO Fading Channels , 2013, IEEE Transactions on Communications.

[17]  Alan J. Laub,et al.  Matrix analysis - for scientists and engineers , 2004 .

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