An efficient key predistribution scheme for ad hoc network security

Authors:
M. Ramkumar;N. Memon
Affiliations:
Dept. of Comput. Sci. & Eng., Mississippi State Univ., MS, USA;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 15

On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs

ACM Transactions on Information and System Security (TISSEC)
Load-balanced key establishment methodologies in wireless sensor networks

International Journal of Security and Networks
A pairwise key establishment scheme for heterogeneous sensor networks

Proceedings of the 1st ACM international workshop on Heterogeneous sensor and actor networks
An Application-Oriented Framework for Wireless Sensor Network Key Establishment

Electronic Notes in Theoretical Computer Science (ENTCS)
An electronic voting protocol with deniable authentication for mobile ad hoc networks

Computer Communications
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks

ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Anti-counterfeiting, key distribution, and key storage in an ambient world via physical unclonable functions

Information Systems Frontiers
A highly resilient and zone-based key predistribution protocol for multiphase wireless sensor networks

Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks
Tree-based key predistribution for wireless sensor networks

Wireless Networks
The subset keys and identity tickets (SKIT) key distribution scheme

IEEE Transactions on Information Forensics and Security
Efficient fine-grained data access control in wireless sensor networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Self-Updating hash chains and their implementations

WISE'06 Proceedings of the 7th international conference on Web Information Systems
On broadcast encryption with random key pre-distribution schemes

ICISS'05 Proceedings of the First international conference on Information Systems Security
A lightweight anonymous routing protocol without public key en/decryptions for wireless ad hoc networks

Information Sciences: an International Journal
Broadcast encryption based non-interactive key distribution in MANETs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.07

Visualization

Abstract

We introduce hashed random preloaded subsets (HARPS), a highly scalable key predistribution (KPD) scheme employing only symmetric cryptographic primitives. HARPS is ideally suited for resource constrained nodes that need to operate for extended periods without active involvement of a trusted authority (TA), as is usually the case for nodes forming ad hoc networks (AHNs). HARPS, a probabilistic KPD scheme, is a generalization of two other probabilistic KPDs. The first, random preloaded subsets (RPSs), is based on random intersection of keys preloaded in nodes. The second, proposed by Leighton and Micali (LM) is a scheme employing repeated applications of a cryptographic hash function. We investigate many desired properties of HARPS like scalability, computational and storage efficiency, flexibility in deployment modes, renewability, ease of extension to multicast scenarios, ability to cater for broadcast authentication, broadcast encryption, etc., to support its candidacy as an enabler for ad hoc network security. We analyze and compare the performance of the three schemes and show that HARPS has significant advantages over other KPDs, and in particular, over RPS and LM.