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 in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Combinatorial Designs: Constructions and Analysis
Combinatorial Designs: Constructions and Analysis
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
Group-based key pre-distribution in wireless sensor networks
Proceedings of the 4th ACM workshop on Wireless security
Combinatorial design of key distribution mechanisms for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Information and System Security (TISSEC)
Simulation modeling of secure wireless sensor networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Distributed KDC-based random pairwise key establishment in wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on design, implementation, and evaluation of wireless sensor network systems
Hi-index | 0.00 |
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pioneering scheme, its extensions, as well as threshold schemes, become insecure when a large number of nodes are captured. We propose a general technique, called virtual key ring, that can effectively strengthen the resilience of random key pre-distribution systems against node capture attacks by reducing the pre-loaded keying material while maintaining secure connectivity of the network. The technique is general and applicable to many key pre-distribution systems. We however focus on the original EG scheme and propose a virtual key ring system based on this pioneering scheme. We provide detailed mathematical analysis and a security proof for the system, and use extensive simulation to validate the analysis and to compare performance of the new system with the original EG scheme. We also present simulation results for the strengthened resilience when the virtual key ring scheme is combined with the multipath key reinforcement and q-composite techniques, showing that the system resilience is substantially improved against large-scale node capture attack (e.g., 40% of nodes captured).