An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
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
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Random key-assignment for secure Wireless Sensor Networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Path key establishment using multiple secured paths in wireless sensor networks
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
The Strange Logic of Random Graphs
The Strange Logic of Random Graphs
Cooperative secret delivery in wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxy-based scheme in [1] and [2], we introduce a friend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friend-based scheme performs better than the proxy-based scheme in terms of resilience against node capture.