Comments on “Distributed symmetric key management for mobile ad hoc networks”

Authors:
J. Wu;R. Wei
Affiliations:
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada;Department of Computer Science, Lakehead University, Thunder Bay, Ontario, P7B 5E1, Canada
Venue:
Information Processing Letters
Year:
2009

Citing 5
Cited 0

A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
A pairwise key predistribution scheme for wireless sensor networks

ACM Transactions on Information and System Security (TISSEC)
Product construction of key distribution schemes for sensor networks

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography

Quantified Score

Hi-index	0.89

Visualization

Abstract

In IEEE INFOCOM 2004, Chan proposed a distributed key management scheme for mobile ad hoc networks, and deduced the condition under which the key sets distributed to the network nodes can form a cover-free family (CFF), which is the precondition that the scheme can work. In this paper, we indicate that the condition is falsely deduced. Furthermore, we discuss whether CFF is capable for key distributions in ad hoc networks.