The Community for Technology Leaders
RSS Icon
Issue No.02 - February (2011 vol.10)
pp: 205-215
Chan Chen , Brigham Young University, Provo
Michael A. Jensen , Brigham Young University, Provo
When implementing data encryption and decryption in a symmetric cryptosystem, secure distribution of the secret key to legitimate nodes can be a challenge. In this paper, we consider establishing secret keys using the common wireless channel, with particular emphasis on the spatial and temporal correlations of the channel coefficients. Specifically, we investigate the influence of channel correlation on the bound of the key size generated from the common channel using a simple single-input single-output channel model, and we verify the existence of a sampling approach able to generate a key using the minimum possible sampling window. We also explore decorrelation of the channel coefficients in a multiple-input multiple-output channel, and we use a statistical independence test to demonstrate that this process cannot be separated into spatial and temporal decorrelation processes. The insights gained from these studies assist in the development of a practical key generation protocol based on a published channel coefficient quantization method and incorporating flexible quantization levels, transmission of the correlation eigenvector matrix, and LDPC coding to improve key agreement in an authenticated public channel. Finally, we present simulations with real channel measurements that solidify the fundamental conclusions.
Cryptography, correlation, security, MIMO systems.
Chan Chen, Michael A. Jensen, "Secret Key Establishment Using Temporally and Spatially Correlated Wireless Channel Coefficients", IEEE Transactions on Mobile Computing, vol.10, no. 2, pp. 205-215, February 2011, doi:10.1109/TMC.2010.114
[1] G.R. Cooper, Modern Communications and Spread Spectrum. McGraw Hill, Inc., 1986.
[2] A.L. Swindlehurst, "Fixed SINR Solutions for the MIMO Wiretap Channel," Proc. Int'l Conf. Acoustics, Speech and Signal Processing, pp. 2437-2440, Apr. 2009.
[3] W. Stallings, Cryptography and Network Security: Principles and Practice, third ed. Prentice Hall, 2003.
[4] U.M. Maurer, "Secret Key Agreement by Public Discussion from Common Information," IEEE Trans. Information Theory, vol. 39, no. 3, pp. 733-742, May 1993.
[5] C.H. Bennett, G. Brassard, C. Crépeau, and U.M. Maurer, "Generalized Privacy Amplification," IEEE Trans. Information Theory, vol. 41, no. 6, pp. 1915-1923, Nov. 1995.
[6] C. Ye, A. Reznik, and Y. Shah, "Extracting Secrecy from Jointly Gaussian Random Variables," Proc. Int'l Symp. Information Theory, pp. 2593-2597, 2006.
[7] R. Wilson, D. Tse, and R.A. Scholtz, "Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels," IEEE Trans. Information Forensics and Security, vol. 2, no. 3, pp. 364-375, Sept. 2007.
[8] M.G. Madiseh, M.L. McGuire, S.S. Neville, L. Cai, and M. Horie, "Secret Key Generation and Agreement in UWB Communication Channels," Proc. IEEE Globecom, pp. 1-5, Nov./Dec. 2008.
[9] M. Bloch, J. Barros, M. Rodrigues, and S.W. McLaughlin, "Wireless Information-Theoretic Security," IEEE Trans. Information Theory, vol. 54, no. 6, pp. 2515-2534, June 2008.
[10] C. Ye, S. Mathur, A. Reznik, Y. Shah, W. Trappe, and N. Mandayam, "Information-Theoretically Secret Key Generation for Fading Wireless Channels," IEEE Trans. Information Forensics and Security, vol. 5, no. 2,pp. 240-254, June 2010.
[11] R. Ahlswede and I. Csiszàr, "Common Randomness in Information Theory and Cryptography—Part I. Secret Sharing," IEEE Trans. Information Theory, vol. 39, no. 4, pp. 1121-1132, July 1993.
[12] J.W. Wallace, C. Chen, and M.A. Jensen, "Key Generation Exploiting MIMO Channel Evolution: Algorithms and Theoretical Limits," Proc. Third European Conf. Antennas and Propagation, Mar. 2009.
[13] M.N. Wegman and J.L. Carter, "New Hash Functions and Their Use in Authentication and Set Equality," J. Computer and System Sciences, vol. 22, pp. 265-279, 1981.
[14] U. Maurer and S. Wolf, "Secret-Key Agreement over Unauthenticated Public Channels—Part I: Definition and a Completeness Result," IEEE Trans. Information Theory, vol. 49, no. 4, pp. 822-831, Apr. 2003.
[15] J.W. Wallace, M.A. Jensen, A.L. Swindlehurst, and B.D. Jeffs, "Experimental Characterization of the MIMO Wireless Channel: Data Acquisition and Analysis," IEEE Trans. Wireless Comm., vol. 2, no. 2 pp. 335-343, Mar. 2003.
[16] W.C. Jakes, Microwave Mobile Communications. IEEE, 1993.
[17] G.H. Golub and C.F. Van Loan, Matrix Computations, second ed. The Johns Hopkins Univ., 1989.
[18] J.W. Wallace and M.A. Jensen, "Time Varying MIMO Channels: Measurement, Analysis, and Modeling," IEEE Trans. Antennas Propagation, vol. 54, no. 11, pp. 3265-3273, Nov. 2006.
[19] A.C. Rencher, Methods of Multivariate Analysis, second ed. John Wiley & Sons Inc., 2002.
[20] N. Patwari, J. Croft, S. Jana, and S.K. Kasera, "High Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements," IEEE Trans. Mobile Computing, vol. 9, no. 1, pp. 17-30, Jan. 2009.
[21] A. Sayeed and A. Perrig, "Secure Wireless Communications: Secret Keys through Multipath," Proc. Int'l Conf. Acoustics, Speech and Signal Processing, pp. 3013-3016, Mar./Apr., 2008.
[22] C. Ye, A. Reznik, G. Sternberg, and Y. Shah, "On the Secrecy Capabilities of ITU Channels," Proc. 2007 66th IEEE Vehicular Technology Conf., pp. 2030-2034, Sept./Oct. 2007.
[23] J.L. Carter and M.N. Wegman, "Universal Classes of Hash Functions," J. Computer and System Sciences, vol. 18, pp. 143-154, 1979.
[24] A.D. Liveris, Z. Xiong, and C.N. Georghiades, "Compression of Binary Sources with Side Information at the Decoder Using LDPC Codes," IEEE Comm. Letters, vol. 6, no. 10, pp. 440-442, Oct. 2002.
[25] D.J.C. MacKay, "Encyclopedia of Sparse Graph Codes," codesdata.html#l55, 2010.
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool