Communications of the ACM
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
Path set selection in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
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
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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
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
Location-based pairwise key establishments for static sensor networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Node-disjointness-based multipath routing for mobile ad hoc networks
PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Location-aware key management scheme for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Revisiting random key pre-distribution schemes for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Group-based key pre-distribution in wireless sensor networks
Proceedings of the 4th ACM workshop on Wireless security
Wireless telemedicine and m-health: technologies, applications and research issues
International Journal of Sensor Networks
The effect of leaders on the consistency of group behaviour
International Journal of Sensor Networks
Security and Communication Networks
Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
Resource aware random key predistribution schemes have been proposed to overcome the limitations of energy constrained Wireless Sensor Networks (WSNs). In most of these schemes, each sensor node is loaded with a key ring. Neighbouring nodes are considered to be connected through a secure link if they share a common key. Nodes which are not directly connected establish a secure path which is then used to negotiate a symmetric key. However, since different symmetric keys are used for different links along the secure path, each intermediate node must first decrypt the message received from the upstream node. Notice that during this process, the negotiated key is revealed to each node along the secure path. The objective of this paper is to address this shortcoming. To this end, we propose an end-to-end pairwise key establishment scheme which uses a properly selected set of node disjoint paths to securely negotiate symmetric keys between sensor nodes. We show through analysis and simulation that our scheme is highly secure against node captures in WSNs.