skip to main content
10.1145/1755688.1755703acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
research-article

Securing wireless sensor networks against large-scale node capture attacks

Published:13 April 2010Publication History

ABSTRACT

Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pioneering scheme, its extensions, as well as threshold schemes, become insecure when a large number of nodes are captured. We propose a general technique, called virtual key ring, that can effectively strengthen the resilience of random key pre-distribution systems against node capture attacks by reducing the pre-loaded keying material while maintaining secure connectivity of the network.

The technique is general and applicable to many key pre-distribution systems. We however focus on the original EG scheme and propose a virtual key ring system based on this pioneering scheme. We provide detailed mathematical analysis and a security proof for the system, and use extensive simulation to validate the analysis and to compare performance of the new system with the original EG scheme. We also present simulation results for the strengthened resilience when the virtual key ring scheme is combined with the multipath key reinforcement and q-composite techniques, showing that the system resilience is substantially improved against large-scale node capture attack (e.g., 40% of nodes captured).

References

  1. S. Camtepe and B. Yener, "Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks", IEEE/ACM Transactions on Networking, pp. 346--358, April 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Stinson, Combinatorial Designs: Construction and Analysis, Springer-Verlag, New York, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Carman, P. Kruus, and B. Matt, "Constraints and Approaches for Distributed Sensor Network Security", NAI Labs Technical Report #00--010, September 2000.Google ScholarGoogle Scholar
  4. H. Chan and A. Perrig, "PIKE: Peer Intermediaries for Key Establishment in Sensor Networks", Proceedings of IEEE INFOCOM, pp. 524--535, 2005.Google ScholarGoogle Scholar
  5. H. Chan, A. Perrig, and D. Song, "Random Key Predistribution Schemes for Sensor Networks", Proceedings of IEEE Security and Privacy Symposium, pp. 197--213, May 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. W. Du, J. Deng, Y. Han, S. Chen, and P. Varshney, "A Key Management Scheme for Wireless Sensor Networks using Deployment Knowledge", Proceedings of IEEE INFOCOM, pp. 586--597, March 2004.Google ScholarGoogle Scholar
  7. W. Du, J. Deng, Y. Han, P. Varshney, J. Katz, and A. Khalili, "A Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks", Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 42--51, October 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Eschenauer and V. Gligor, "A Key Management Scheme for Distributed Sensor Networks", Proceedings of the 9th ACM Conference on Computer and Communication Security, pp. 41--47, November 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Huang, M. Mehta, D. Medhi, and L. Harn, "Location-aware Key Management Scheme for Wireless Sensor Networks", Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks, pp. 29--42, October 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Internet Engineering Task Force, "Diffie-Hellman Key Agreement Method", http://tools.ietf.org/html/rfc2631, 1999.Google ScholarGoogle Scholar
  11. D. Liu and P. Ning, "Location-based Pairwise Key Establishments for Static Sensor Networks", Proceedings of ACM Workshop on Security in Ad Hoc and Sensor Networks, pp. 72--82, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Liu, P. Ning, and W. Du, "Group-based Key Pre-distribution in Wireless Sensor Networks", Proceedings of ACM Workshop on Wireless Security, pp. 11--20, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Liu, P. Ning, and R. Liu, "Establishing Pairwise Keys in Distributed Sensor Networks", Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 52--61, October 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. R. Pietro, L. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan, "Redoubtable Sensor Networks", ACM Transactions on Information and System Security, 11(3):1--22, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Spencer, "The Strange Logic of Random Graphs", Algorithms and Combinatorics, Vol. 22, Springer-Verlag, ISBN 3-540-41654-4, 2000.Google ScholarGoogle Scholar
  16. T. Vu, "Modeling, Analysis, and Simulation of Secure Connectivity in Wireless Sensor Networks", MSc thesis, Department of Computer Science, University of Calgary, October 2009.Google ScholarGoogle Scholar
  17. T. Vu, C. Williamson, and R. Safavi-Naini, "Simulation Modeling of Secure Wireless Sensor Networks", Proceedings of ValueTools '09, Pisa, Italy, October 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Securing wireless sensor networks against large-scale node capture attacks

    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
      ASIACCS '10: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
      April 2010
      363 pages
      ISBN:9781605589367
      DOI:10.1145/1755688

      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: 13 April 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      ASIACCS '10 Paper Acceptance Rate25of166submissions,15%Overall Acceptance Rate418of2,322submissions,18%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader