A key distribution scheme preventing collusion attacks in ubiquitous heterogeneous sensor networks

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Random key pre-distribution schemes are vulnerable to collusion attacks. In this paper, we propose a new key management scheme for ubiquitous heterogeneous sensor networks consisting of a small number of powerful high-end ℋ-sensors and a large number of ordinary low-end ℒ-sensors. The collusion attack on key pre-distribution scheme mainly takes advantage of the globally applicable keys, which are selected from the same key pool. As a result, in our scheme, after discovering the shared pairwise keys with neighbors, all ℋ-nodes and ℒ-nodes destroy their initial key rings and generate new key rings by applying one-way hash function on node's ID and initial key ring. The analysis of proposed scheme shows that even if a large number of nodes are compromised, an adversary can only exploit a small number of keys nearby the compromised nodes, while other keys in the network remain safe. It outperforms the previous random key pre-distribution schemes by considerably reducing the storage requirement, while providing more resiliency against node capture and collusion attacks. © IFIP International Federation for Information Processing 2007.

Cite

CITATION STYLE

APA

Kausar, F., Hussain, S., Jong, H. P., & Masood, A. (2007). A key distribution scheme preventing collusion attacks in ubiquitous heterogeneous sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4809 LNCS, pp. 745–757). Springer Verlag. https://doi.org/10.1007/978-3-540-77090-9_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free