skip to main content
10.1145/1741866.1741889acmconferencesArticle/Chapter ViewAbstractPublication PageswisecConference Proceedingsconference-collections
research-article

Secret keys from entangled sensor motes: implementation and analysis

Published:22 March 2010Publication History

ABSTRACT

Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and compromise necessitate the use of an on-line key generation, where secret keys are generated by the nodes themselves. However, the cost of such schemes is high since their secrecy is based on computational complexity. Recently, several research contributions justified that the wireless channel itself can be used to generate information-theoretic secure keys between two parties. By exchanging sampling messages during movement, a bit string can be derived that is only known to the involved entities. Yet, movement is not the only possibility to generate randomness. The channel response is also strongly dependent on the frequency of the transmitted signal. In our work, we introduce a protocol for key generation based on the frequency-selectivity of channel fading. The great practical advantage of this approach is that we do not rely on node movement as the source of randomness. Thus, the frequent case of a sensor network with static motes is supported. Furthermore, the error correction property of the proposed protocol mitigates the effects of measurement errors and other temporal effects, giving rise to a key agreement rate of over 97%. We show the applicability of our protocol by implementing it on MICAz motes, and evaluate its robustness and secrecy through experiments and analysis.

References

  1. C.H. Foh A. Bose. A practical path loss model for indoor WiFi positioning enhancement. In International Conference on Information, Communications & Signal Processing, pages 1--5, 2007.Google ScholarGoogle Scholar
  2. Babak Azimi-Sadjadi, Aggelos Kiayias, Alejandra Mercado, and Bulent Yener. Robust Key Generation from Signal Envelopes in Wireless Networks. In CCS '07: Proceedings of the 14th ACM Conference on Computer and Communications Security, pages 401--410, New York, NY, USA, 2007. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S.A. Camtepe and B. Yener. Key Distribution Mechanisms for Wireless Sensor Networks: a Survey, 2005. Technical Report TR-05-07 Renesselaer Polytechnic Institute, Computer Science Department, March 2005.Google ScholarGoogle Scholar
  4. James J. Filliben. The probability plot correlation coefficient test for normality. Technometrics, 17(1):111--117, 1975.Google ScholarGoogle ScholarCross RefCross Ref
  5. K. Kaemarungsi and P. Krishnamurthy. Modeling of indoor positioning systems based on location fingerprinting. In Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 2, pages 1012--1022, March 2004.Google ScholarGoogle ScholarCross RefCross Ref
  6. A. Liu and P. Ning. TinyECC: A configurable library for elliptic curve cryptography in wireless sensor networks. In Information Processing in Sensor Networks, 2008. IPSN'08. International Conference on, pages 245--256, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Suhas Mathur, Wade Trappe, Narayan Mandayam, Chunxuan Ye, and Alex Reznik. Radio-telepathy: Extracting a Secret Key from an Unauthenticated Wireless Channel. In MobiCom '08: Proceedings of the 14th ACM International Conference on Mobile Computing and Networking, pages 128--139, New York, NY, USA, 2008. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ueli Maurer, Renato Renner, and Stefan Wolf. Unbreakable keys from random noise. In P. Tuyls, B. Skoric, and T. Kevenaar, editors, Security with Noisy Data, pages 21--44. Springer-Verlag, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  9. Theodore Rappaport. Wireless Communications: Principles and Practice. Prentice Hall PTR, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Thomas Schürmann and Peter Grassberger. Entropy estimation of symbol sequences. CHAOS, 6:414, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  11. Yong Sheng, Keren Tan, Guanling Chen, David Kotz, and Andrew Campbell. Detecting 802.11 MAC layer spoofing using received signal strength. In Proceedings of the 27th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 1768--1776, April 2008.Google ScholarGoogle Scholar
  12. Ulrich Speidel, Mark Titchener, and Jia Yang. How well do practical information measures estimate the Shannon entropy? In Proc. of the Fifth International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP 2006), pages 861--865. IEEE, 2006.Google ScholarGoogle Scholar
  13. Arvinderpal Wander, Nils Gura, Hans Eberle, Vipul Gupta, and Sheueling Chang Shantz. Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks. In Proceedings of the third annual IEEE International Conference on Pervasive Computing and Communications (PerCom '05), pages 324--328, March 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Matthias Wilhelm, Ivan Martinovic, and Jens B. Schmitt. On Key Agreement in Wireless Sensor Networks based on Radio Transmission Properties. In Proceedings of the 5th Annual Workshop on Secure Network Protocols (NPSec), pages 37--42, Princeton, New Jersey, USA, October 2009. IEEE Computer Society.Google ScholarGoogle ScholarCross RefCross Ref
  15. Y. Xiao, V.K. Rayi, B. Sun, X. Du, F. Hu, and M. Galloway. A Survey of Key Management Schemes in Wireless Sensor Networks. Computer communications, 30(11-12):2314--2341, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Secret keys from entangled sensor motes: implementation and analysis

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            WiSec '10: Proceedings of the third ACM conference on Wireless network security
            March 2010
            186 pages
            ISBN:9781605589237
            DOI:10.1145/1741866

            Copyright © 2010 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 22 March 2010

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            Overall Acceptance Rate98of338submissions,29%

            Upcoming Conference

            WiSec '24

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader