DocumentCode :
3310637
Title :
Key splitting for random key distribution schemes
Author :
Ehdaie, M. ; Alexiou, Nikolaos ; Ahmadian, Mohammad ; Aref, Mohammad Reza ; Papadimitratos, Panos
Author_Institution :
CCL, K.N.Toosi Univ. of Technol., Tehran, Iran
fYear :
2012
fDate :
Oct. 30 2012-Nov. 2 2012
Firstpage :
1
Lastpage :
6
Abstract :
A large number of Wireless Sensor Network (WSN) security schemes have been proposed in the literature, relying primarily on symmetric key cryptography. To enable those, Random Key pre-Distribution (RKD) systems have been widely accepted. However, WSN nodes are vulnerable to physical compromise. Capturing one or more nodes operating with RKD would give the adversary keys to compromise communication of other benign nodes. Thus the challenge is to enhance resilience of WSN to node capture, while maintaining the flexibility and low-cost features of RKD. We address this problem, without any special-purpose hardware, proposing a new and simple idea: key splitting. Our scheme does not increase per-node storage, and computation and communication overheads, and it can increase connectivity. More important, it achieves a significant increase in resilience to compromise compared to the state of the art, notably when the adversary does not have overwhelming computational power.
Keywords :
cryptography; telecommunication security; wireless sensor networks; RKD systems; WSN; key splitting; random key distribution schemes; random key pre-distribution systems; security schemes; symmetric key cryptography; wireless sensor network; Peer to peer computing; Probability; Protocols; Resilience; Security; Sensors; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Network Protocols (ICNP), 2012 20th IEEE International Conference on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4673-2445-8
Electronic_ISBN :
978-1-4673-2446-5
Type :
conf
DOI :
10.1109/ICNP.2012.6459951
Filename :
6459951
Link To Document :
بازگشت