MIMO transmissions with information-theoretic secrecy for secret-key agreement in wireless networks

Information-theoretic secrecy gives the strongest information security that is important for military wireless networks. In this paper, we show that randomized MIMO transmissions can achieve such secrecy. A method is proposed to randomize the MIMO transmission coefficients. The received signal of the adversary has some special statistical distributions, based on which the indeterminacy of the adversary's blind deconvolution is proved. Receiving error rates and secret channel capacity are analyzed and simulated. This paper points out a practical way to realize the well-known wire-tap channel for perfect secrecy, which is one of the interesting challenges in information theory. The proposed method is also useful for key management in military wireless networks

[1]  Ueli Maurer,et al.  Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result , 2003, IEEE Trans. Inf. Theory.

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

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

[4]  Alfred O. Hero,et al.  Secure space-time communication , 2003, IEEE Trans. Inf. Theory.

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

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

[7]  Mo Chen,et al.  A Randomized Space-Time Transmission Scheme for Secret-Key Agreement , 2005 .

[8]  R. Muirhead Aspects of Multivariate Statistical Theory , 1982, Wiley Series in Probability and Statistics.