Communications of the ACM
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Group-based key pre-distribution in wireless sensor networks
Proceedings of the 4th ACM workshop on Wireless security
Improving key predistribution with deployment knowledge in static sensor networks
ACM Transactions on Sensor Networks (TOSN)
Efficient path key establishment for wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Message authentication for wireless sensor networks
CIS'09 Proceedings of the international conference on Computational and information science 2009
Efficient message authentication protocol for WSN
WSEAS Transactions on Computers
| Hi-index | 0.00 |
Secure communication is a necessity for some wireless sensor network (WSN) applications. However, the resource constraints of a sensor render existing cryptographic systems for traditional network systems impractical for a WSN. Random key predistribution scheme has been proposed to overcome these limits. In this scheme, a ring of keys is randomly drawn from a large key pool and assigned to a sensor. Nodes sharing common keys can communicate securely using a shared key, while a path-key is established for those nodes that do not share any common keys. This scheme requires moderate memory and processing power, thus it is considered suitable for WSN applications. However, since the shared key is not exclusively owned by the two end entities, the established path-key may be revealed to other nodes just by eavesdropping. Based on the random-key predistribution scheme, we present a framework that utilizes multiple proxies to secure the path-key establishment. Our scheme is resilient against node capture, collusive attack, and random dropping, while only incurring a small amount of overhead. Furthermore, the scheme ensures that, with high probability, all path-keys are exclusively known by the two end nodes involved in the communication along the path.