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 method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
Distributed Detection of Node Replication Attacks in Sensor Networks
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
IEEE Communications Magazine
| Hi-index | 0.00 |
Current key predistribution schemes for wireless sensor networks derive the merit of their performance based on the resilience of secure communication links to node-compromise attacks. As an adversarial entity gathers key information, it is able to mount attacks by spoofing or eavesdropping on networked communications with growing success. A powerful variety of attack is possible with a spoofed node, which is when the adversary is able to present itself as a legitimate identity in the network and not be detected. This work considers the security of wireless sensor networks with a priority on node-spoofing attacks. We propose node-spoofing attack models to classify various adversarial capabilities. We then propose two new key predistribution techniques as variants to random key predistribution, which provide improved resilience to node-spoofing attacks.