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
Pair-wise path key establishment in wireless sensor networks
Computer Communications
Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks
A new scheme for establishing pairwise keys for wireless sensor networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Foisting and stealing of keys in sensor networks
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Cooperative secret delivery in wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.00 |
Random key Pre-distribution scheme has been proposed to overcome the memory, computation and energy limits of individual sensor in wireless sensor networks. 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, path-key needs to be established for those nodes who do not share any common keys. However, there is no hard security guarantee for path key set up in existing protocols. In this paper, we propose two new methods to discover multiple secure proxies and a scheme to secure path key establishment using secure proxies discovered. We show both from analysis and simulation that our scheme can achieve a high level of security against node capture based on the network parameters the user has chosen, meanwhile only incurring a small amount of overhead. All path keys established in our scheme is exclusively known by two end nodes with high probability.