Skip to main content

An Energy and Communication Efficient Group Key in Sensor Networks Using Elliptic Curve Polynomial

  • Conference paper
Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4686))

Included in the following conference series:

Abstract

Sensor nodes have limited computation and battery power, and are not very reliable. A sensor network needs to be secure against eavesdrop when it is deployed in hostile environments. In order to provide security at low cost, symmetric key based approaches [11] have been proposed. In [9], an elliptic curve cryptography based approach has been implemented to facilitate the public-key cryptography. However, these schemes become ineffective in terms memory usage, communication time and energy required with the rapidly growing network size. We propose an Energy and Communication Efficient Group key management (ECEG) scheme which reduces the usage of memory, communication and energy in sensors. This scheme designed based on the idea that each node is pre-loaded with a key chain and an elliptic curve. In our scheme instead of computing the key by collaborating with other nodes a point of the elliptic curve broadcasted from the base station is used to compute the key. The simulations conducted using TinyOS [15] shows that ECEG scheme significantly improves the communication and energy usage in computing the key over EccM [9].

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Carman, D.W., Kruus, P.S., Matt, B.J.: Constraints and approaches for distributed sensor network security. NAI Labs Technical Report 00-010 (September 2000)

    Google Scholar 

  2. Chan, A.C., Rogers, Sr., E.S.: Distributed Symmetric Key Management for Mobile Ad hoc Networks IEEE INFOCOM (2004)

    Google Scholar 

  3. Du, W., Deng, J., Han, Y.S., Varshney, P.: A Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks. In: CCS. Proceedings of the 10th ACM Conference on Computer and Communications Security, Washington DC (October 27-31, 2003)

    Google Scholar 

  4. Du, W., Deng, J., Han, Y.S., Chen, S., Varshney, P.: A Key Management Scheme for Wireless Sensor Networks Using Deployment Knowledge. IEEE INFOCOM (2004)

    Google Scholar 

  5. Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM conferenceon Computer and communications security, Washington, DC, USA (November 18–22, 2002)

    Google Scholar 

  6. Karlof, C., Sastry, N., Wagner, D.: TinySec: A Link Layer Security Architecture for Wireless Sensor Networks, Proceedings of the Second ACM Conference on Embedded Networked Sensor Systems (SenSys 2004) (November 2004)

    Google Scholar 

  7. Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocols for Wireless Microsensor Networks. In: Proc. Hawaaian Int’l Conf. on Systems Science (January 2000)

    Google Scholar 

  8. Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks. OSDI (December 2002)

    Google Scholar 

  9. Malan, D., Welsh, M., Smith, M.: A Public-Key Infrastructure for Key Distribution in TinyOS Based on Elliptic Curve Cryptography, IEEE SECON (2004)

    Google Scholar 

  10. Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)

    Google Scholar 

  11. Perrig, A., Szewczyk, R., Wen, V., Culler, D., Tygar, J.D.: SPINS: Security protocols for sensor networks. In: Proceedings of Mobicom (2001)

    Google Scholar 

  12. Sun, Y., Liu, K.J.R.: Scalable Hierarchical Access Control in Secure Group Communications, IEEE INFOCOM (2004)

    Google Scholar 

  13. Steiner, M., Tsudik, G., Waidner, M.: Key Agreement in Dynamic Peer Groups. IEEE Transactions on Parallel and Distributed Systems 11(8), 769–780 (2000)

    Article  Google Scholar 

  14. http://www.xbow.com/Products/Wireless_Sensor_Networks.htm

  15. http://www.tinyos.net/

  16. Ye, F., Luo, H., Lu, S., Zhang, L.: Statistical En-route Filtering of Injected False Data in Sensor Networks, INFOCOM (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Evangelos Kranakis Jaroslav Opatrny

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Panja, B., Madria, S.K. (2007). An Energy and Communication Efficient Group Key in Sensor Networks Using Elliptic Curve Polynomial. In: Kranakis, E., Opatrny, J. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2007. Lecture Notes in Computer Science, vol 4686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74823-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74823-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74822-9

  • Online ISBN: 978-3-540-74823-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics