An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Secret-key agreement without public-key
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Location-based pairwise key establishments for static sensor networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Location-aware key management scheme for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
A Deterministic Pairwise Key Pre-distribution Scheme for Mobile Sensor Networks
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Efficient Hybrid Security Mechanisms for Heterogeneous Sensor Networks
IEEE Transactions on Mobile Computing
A survey of key management schemes in wireless sensor networks
Computer Communications
ACM Transactions on Information and System Security (TISSEC)
An Application-Oriented Framework for Wireless Sensor Network Key Establishment
Electronic Notes in Theoretical Computer Science (ENTCS)
Product construction of key distribution schemes for sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
On the security of wireless sensor networks
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Tree-Based key distribution patterns
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
An efficient key predistribution scheme for ad hoc network security
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The establishment of secure links between neighboring nodes is one of the most challenging problems in wireless sensor networks. In this article, we present an efficient key predistribution scheme for sensor networks such that pairwise keys are defined by iterated hash computations based on a tree structure. Our scheme can be regarded as an improvement of HARPS, Ramkumar and Memon (IEEE J Sel Area Commun 23(3):611---621, 2005),or a generalization of Leighton and Micali's scheme (Lect Notes Comput Sci 773:456---479, 1994). We rigorously analyze our scheme focusing on the resiliency of the network and hash computational complexity for each node and compare the performance with existing schemes. Specifically, we show that our scheme provides stronger resiliency and requires less hash computational complexity than HARPS.