The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2013 vol.12)
pp: 917-930
Sriram Nandha Premnath , University of Utah, Salt Lake City
Suman Jana , University of Utah, Salt Lake City
Jessica Croft , University of Utah, Salt Lake City
Prarthana Lakshmane Gowda , University of Utah, Salt Lake City
Mike Clark , Air Force Research Laboratory and Air Force Institute of Technology
Sneha Kumar Kasera , University of Utah, Salt Lake City
Neal Patwari , University of Utah, Salt Lake City
Srikanth V. Krishnamurthy , University of California, Riverside, Riverside
We evaluate the effectiveness of secret key extraction, for private communication between two wireless devices, from the received signal strength (RSS) variations on the wireless channel between the two devices. We use real world measurements of RSS in a variety of environments and settings. The results from our experiments with 802.11-based laptops show that 1) in certain environments, due to lack of variations in the wireless channel, the extracted bits have very low entropy making these bits unsuitable for a secret key, 2) an adversary can cause predictable key generation in these static environments, and 3) in dynamic scenarios where the two devices are mobile, and/or where there is a significant movement in the environment, high entropy bits are obtained fairly quickly. Building on the strengths of existing secret key extraction approaches, we develop an environment adaptive secret key generation scheme that uses an adaptive lossy quantizer in conjunction with Cascade-based information reconciliation and privacy amplification. Our measurements show that our scheme, in comparison to the existing ones that we evaluate, performs the best in terms of generating high entropy bits at a high bit rate. The secret key bit streams generated by our scheme also pass the randomness tests of the NIST test suite that we conduct. We also build and evaluate the performance of secret key extraction using small, low-power, hand-held devices—Google Nexus One phones—that are equipped 802.11 wireless network cards. Last, we evaluate secret key extraction in a multiple input multiple output (MIMO)-like sensor network testbed that we create using multiple TelosB sensor nodes. We find that our MIMO-like sensor environment produces prohibitively high bit mismatch, which we address using an iterative distillation stage that we add to the key extraction process. Ultimately, we show that the secret key generation rate is increased when multiple sensors are involved in the key extraction process.
Privacy, Wireless communication, Entropy, Quantization, Bit rate, Educational institutions, key generation, Wireless networks, multipath fading, physical layer, cryptography
Sriram Nandha Premnath, Suman Jana, Jessica Croft, Prarthana Lakshmane Gowda, Mike Clark, Sneha Kumar Kasera, Neal Patwari, Srikanth V. Krishnamurthy, "Secret Key Extraction from Wireless Signal Strength in Real Environments", IEEE Transactions on Mobile Computing, vol.12, no. 5, pp. 917-930, May 2013, doi:10.1109/TMC.2012.63
[1] “NIST, A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications,” 800-22sp-800-22-051501. pdf, 2001.
[2] “ipwraw,” wlan, 2012.
[3] “Radiotap,” http:/, 2012.
[4] “Converting Signal Strength Percentage to dBm Values,” Converting_ Signal_Strength.pdf, 2012.
[5] 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 and Propagation, vol. 53, no. 11, pp. 3776-3784, Nov. 2005.
[6] 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), 2007.
[7] 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.
[8] M. Bloch, J. Barros, M.R.D. Rodrigues, and S.W. McLaughlin, “Wireless Information-Theoretic Security,” IEEE Trans. Information Theory, vol. 54, no. 6, pp. 2515-2534, June 2008.
[9] G. Brassard and L. Salvail, “Secret Key Reconciliation by Public Discussion,” Proc. Workshop Theory and Application of Cryptographic Techniques on Advances in Cryptology, pp. 410-423, 1994.
[10] V. Brik, S. Banerjee, M. Gruteser, and S. Oh, “Wireless Device Identification with Radiometric Signatures,” Proc. ACM MobiCom, 2008.
[11] G.D. Durgin, Space-Time Wireless Channels. Prentice Hall PTR, 2002.
[12] L. Greenemeier, “Election Fix? Switzerland Tests Quantum Cryptography,” Scientific Am., Oct. 2007.
[13] 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.
[14] 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.
[15] R. Impagliazzo, L.A. Levin, and M. Luby, “Pseudo-Random Generation from One-Way Functions,” Proc. 21st Ann. ACM Symp. Theory of Computing (STOC), pp. 12-24, 1989.
[16] S. Jana and S.K. Kasera, “On Fast and Accurate Detection of Unauthorized Access Points Using Clock Skews,” Proc. ACM MobiCom, 2008.
[17] S. Jana, S.N. Premnath, M. Clark, S.K. Kasera, N. Patwari, and S.V. Krishnamurthy, “On the Effectiveness of Secret Key Extraction from Wireless Signal Strength in Real Environments,” Proc. ACM MobiCom, 2009.
[18] Z. Li, W. Xu, R. Miller, and W. Trappe, “Securing Wireless Systems via Lower Layer Enforcements,” Proc. Fifth ACM Workshop Wireless Security (WiSe), 2006.
[19] 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. Comm. Networks Services Research Conf. (CNSR), May 2008.
[20] S. Mathur, W. Trappe, N.B. Mandayam, C. Ye, and A. Reznik, “Radio-Telepathy: Extracting a Secret Key from an Unauthenticated Wireless Channel,” Proc. ACM MobiCom, 2008.
[21] 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.
[22] 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.
[23] A. Sayeed and A. Perrig, “Secure Wireless Communications: Secret Keys through Multipath,” Proc. IEEE Int'l Conf. Acoustics, Speech Signal Processing (ICASSP), pp. 3013-3016, Apr. 2008.
[24] M.A. Tope and J.C. McEachen, “Unconditionally Secure Communications over Fading Channels,” Proc. IEEE Military Comm. Conf. (MILCOM), 2001.
[25] J.W. Wallace, C. Chen, and M.A. Jensen, “Key Generation Exploiting MIMO Channel Evolution: Algorithms and Theoretical Limits,” Proc. Third European Conf. Antennas Propagation (EuCAP), Mar. 2009.
[26] S. Wiesner, “Conjugate Coding,” SIGACT News, vol. 15, no. 1, pp. 78-88, 1983.
[27] J. Wilson and N. Patwari, “Radio Tomographic Imaging with Wireless Networks,” IEEE Trans. Mobile Computing, vol. 9, no. 5, pp. 621-632, May 2010.
[28] 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.
[29] C. Ye, S. Mathur, A. Reznik, Y. Shah, W. Trappe, and N.B. 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.
[30] C. Ye, A. Reznik, and Y. Shah, “Extracting Secrecy from Jointly Gaussian Random Variables,” Proc. IEEE Int'l Symp. Information Theory (ISIT), 2006.
[31] C. Ye, A. Reznik, G. Sternberg, and Y. Shah, “On the Secrecy Capabilities of ITU Channels,” Proc. IEEE 66th Vehicular Technology Conf. (VTC), Oct. 2007.
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool