RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks

Manish Mehta, Dijiang Huang, Lein Harn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

Efficient schemes for key predistribution and shared-key discovery play a vital role in security and efficiency of pairwise key establishment in sensor networks. In this paper, we propose a scheme for key predistribution using hash-chain and subsequent shared-key discovery. We show potential active attacks on sensor networks due to key predistribution which can have severer consequences as compared to attacks described in existing proposals. We also show that as compared to the existing schemes, our scheme is more resilient to these active attacks.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the IEEE International Performance, Computing, and Communications Conference
EditorsT. Dahlberg, R. Oliver, A. Sen, G. Xue
Pages193-197
Number of pages5
StatePublished - 2005
Externally publishedYes
Event24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 - Phoenix, AZ, United States
Duration: Apr 7 2005Apr 9 2005

Other

Other24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005
CountryUnited States
CityPhoenix, AZ
Period4/7/054/9/05

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks'. Together they form a unique fingerprint.

  • Cite this

    Mehta, M., Huang, D., & Harn, L. (2005). RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks. In T. Dahlberg, R. Oliver, A. Sen, & G. Xue (Eds.), Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (pp. 193-197). [4a.3]