The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2010 vol.9)
pp: 17-30
Neal Patwari , University of Utah, Salt Lake City
Jessica Croft , University of Utah, Salt Lake City
Suman Jana , University of Utah, Salt Lake City
Sneha Kumar Kasera , University of Utah, Salt Lake City
ABSTRACT
Secret keys can be generated and shared between two wireless nodes by measuring and encoding radio channel characteristics without ever revealing the secret key to an eavesdropper at a third location. This paper addresses bit extraction, i.e., the extraction of secret key bits from noisy radio channel measurements at two nodes such that the two secret keys reliably agree. Problems include 1) nonsimultaneous directional measurements, 2) correlated bit streams, and 3) low bit rate of secret key generation. This paper introduces high-rate uncorrelated bit extraction (HRUBE), a framework for interpolating, transforming for decorrelation, and encoding channel measurements using a multibit adaptive quantization scheme which allows multiple bits per component. We present an analysis of the probability of bit disagreement in generated secret keys, and we use experimental data to demonstrate the HRUBE scheme and to quantify its experimental performance. As two examples, the implemented HRUBE system can achieve 22 bits per second at a bit disagreement rate of 2.2 percent, or 10 bits per second at a bit disagreement rate of 0.54 percent.
INDEX TERMS
Wireless networks, multipath fading, physical layer, cryptography, key generation.
CITATION
Neal Patwari, Jessica Croft, Suman Jana, Sneha Kumar Kasera, "High-Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements", IEEE Transactions on Mobile Computing, vol.9, no. 1, pp. 17-30, January 2010, doi:10.1109/TMC.2009.88
REFERENCES
[1] C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental Quantum Cryptography,” J. Cryptology, vol. 5, no. 1, pp. 3-28, 1992.
[2] S. Wiesner, “Conjugate Coding,” SIGACT News, vol. 15, no. 1, pp.78-88, 1983.
[3] L. Greenemeier, “Election Fix? Switzerland Tests Quantum Cryptography,” Scientific Am., Oct. 2007.
[4] G.D. Durgin, Space-Time Wireless Channels. Prentice Hall PTR, 2002.
[5] J.E. Hershey, A.A. Hassan, and R. Yarlagadda, “Unconventional Cryptographic Keying Variable Management,” IEEE Trans. Comm., vol. 43, no. 1, pp. 3-6, Jan. 1995.
[6] A.A. Hassan, W.E. Stark, J.E. Hershey, and S. Chennakeshu, “Cryptographic Key Agreement for Mobile Radio,” Elsevier Digital Signal Processing, vol. 6, pp. 207-212, 1996.
[7] A. Sayeed and A. Perrig, “Secure Wireless Communications: Secret Keys through Multipath,” Proc. IEEE Int'l Conf. Acoustic, Speech & Signal Processing (ICASSP '08), pp. 3013-3016, Apr. 2008.
[8] M.G. Madiseh, M.L. McGuire, S.W. Neville, and A.A.B. Shirazi, “Secret Key Extraction in Ultra Wideband Channels for Unsynchronized Radios,” Proc. Sixth Ann. Conf. Comm. Networks and Services Research (CNSR '08), May 2008.
[9] C. Ye, A. Reznik, G. Sternberg, and Y. Shah, “On the Secrecy Capabilities of ITU Channels,” Proc. IEEE Vehicular Technology Conf. (VTC '07-Fall), pp. 2030-2034, Oct. 2007.
[10] R. Wilson, D. Tse, and R.A. Scholtz, “Channel Identification: Secret Sharing Using Reciprocity in UWB Channels,” IEEE Trans. Information Forensics and Security, vol. 2, no. 3, pp. 364-375, Sept. 2007.
[11] B. Azimi-Sadjadi, A. Kiayias, A. Mercado, and B. Yener, “Robust Key Generation from Signal Envelopes in Wireless Networks,” Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07), pp.401-410, Nov. 2007.
[12] Z. Li, W. Xu, R. Miller, and W. Trappe, “Securing Wireless Systems via Lower Layer Enforcements,” Proc. Fifth ACM Workshop Wireless Security (WiSe '06), pp. 33-42, Sept. 2006.
[13] C. Ye, A. Reznik, and Y. Shah, “Extracting Secrecy from Jointly Gaussian Random Variables,” Proc. 2006 IEEE Int'l Symp. Information Theory (ISIT '06), pp. 2593-2597, July 2006.
[14] T. Aono, K. Higuchi, T. Ohira, B. Komiyama, and H. Sasaoka, “Wireless Secret Key Generation Exploiting Reactance-Domain Scalar Response of Multipath Fading Channels,” IEEE Trans. Antennas & Propagation, vol. 53, no. 11, pp. 3776-3784, Nov. 2005.
[15] M.A. Tope and J.C. McEachen, “Unconditionally Secure Communications over Fading Channels,” Proc. Military Comm. Conf. (MILCOM '01), vol. 1, pp. 54-58, Oct. 2001.
[16] S. Mathur, W. Trappe, N. Mandayam, C. Ye, and A. Reznik, “Radio-Telepathy: Extracting a Secret Key from an Unauthenticated Wireless Channel,” Proc. ACM MobiCom, Sept. 2008.
[17] S. Jana and S.K. Kasera, “On Fast and Accurate Detection of Unauthorized Access Points Using Clock Skews,” Proc. ACM MobiCom, Sept. 2008.
[18] U.M. Maurer and S. Wolf, “Unconditionally Secure Key Agreement and the Intrinsic Conditional Information,” IEEE Trans. Information Theory, vol. 45, no. 2, pp. 499-514, Mar. 1999.
[19] 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.
[20] V. Brik, S. Banerjee, M. Gruteser, and S. Oh, “PARADIS: Physical 802.11 Device Identification with Radiometric Signatures,” Proc. ACM MobiCom, pp. 116-127, Sept. 2008.
[21] C. Farrow, “A Continuously Variable Digital Delay Element,” Proc. IEEE Int'l Symp. Circuits and Systems, vol. 3, pp. 2641-2645, June 1998.
[22] M. Rice, Digital Communications: A Discrete-Time Approach. Pearson Prentice Hall, 2009.
[23] A. Nasir and K.R. Rao, Orthogonal Transformations for Digital Signal Processing. Springer Verlag, 1975.
[24] A. Lakhina, M. Crovella, and C. Diot, “Diagnosing Network-Wide Traffic Anomalies,” Proc. ACM SIGCOMM, Aug. 2004.
[25] A. Luminia, D. Maioa, and D. Maltoni, “Continuous versus Exclusive Classification for Fingerprint Retrieval,” Elsevier Pattern Recognition Letters, vol. 18, no. 10, pp. 1027-1034, Oct. 1997.
[26] W.W. Hines, D.C. Montgomery, D.M. Goldsman, and C.M. Borror, Probability and Statistics in Engineering, fourth ed. Wiley, 2003.
[27] NIST, A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, http://csrc.nist.gov/publications/nistpubs/ 800-22sp-800-22-051501. pdf, 2008.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool