Skip to main content

A Further Approach on Hypercube-Based Pairwise Key Establishment in Sensor Networks

  • Conference paper
Ubiquitous Intelligence and Computing (UIC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4159))

Included in the following conference series:

  • 622 Accesses

Abstract

Security schemes of pairwise key establishment play a fundamental role in research on security issue in wireless sensor networks. The properties of weak connectivity in subsection based on hypercube model are addressed, for purpose of achieving inner-area pairwise key establishment. Also a hybrid hypercube model based on location-aware deployment is proposed, focusing on dramatic varieties of network size. Corresponding algorithms on inter-area pairwise key establishment are presented, as well as security and performance analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chong, C.-y., Srikanta, P.K.: Sensor Networks: Evolution, Opportunities, and Challenges. Proceeding of the IEEE 91(8), 1247–1256 (2003)

    Article  Google Scholar 

  2. Du, W., Deng, J., Han, Y.S., et al.: A Pairwise Key Predistribution Scheme for Wireless Sensor Networks. In: Proceedings of 10th ACM Conference on Computer and Communication Security, pp. 42–51 (2003)

    Google Scholar 

  3. Estrin, D., Govindan, R., Heideman, J., Kumar, S.: Next century challenges: Scalable Coordination in Sensor Networks. In: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pp. 263–270 (1999)

    Google Scholar 

  4. Eeschnaure, L., Gligor, V.D.: A Key-management Scheme for Distributed Sensor Networks. In: Proceedings of the 9th ACM Coference on Computer and Communication Security, pp. 41–47 (2002)

    Google Scholar 

  5. Blundo, C., Desantis, A., Kutten, S., et al.: Perfectly Secure Key Distribution for Dynamic Conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)

    Google Scholar 

  6. Chan, H., Oerrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: IEEE Symposium on Research in Security and Privacy, pp. 197–213 (2003)

    Google Scholar 

  7. Liu, D., Ning, P., Li, R.: Establishing Pairwise Keys in Distributed Sensor Networks. ACM Transactions on Information and System Security 8(1), 41–77 (2005)

    Article  Google Scholar 

  8. Liu, D., Ning, P.: Location-Based Pairwise Key Establishments for Static Sensor Networks, available from http://discovery.csc.ncsu.edu/~pning/pubs/sasn03.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, P., Lin, Y. (2006). A Further Approach on Hypercube-Based Pairwise Key Establishment in Sensor Networks. In: Ma, J., Jin, H., Yang, L.T., Tsai, J.JP. (eds) Ubiquitous Intelligence and Computing. UIC 2006. Lecture Notes in Computer Science, vol 4159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11833529_85

Download citation

  • DOI: https://doi.org/10.1007/11833529_85

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38091-7

  • Online ISBN: 978-3-540-38092-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics