An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
IEEE Communications Magazine
ACM Transactions on Information and System Security (TISSEC)
WiSec '08 Proceedings of the first ACM conference on Wireless network security
A Key Predistribution Scheme Based on 3-Designs
Information Security and Cryptology
Comments on “Distributed symmetric key management for mobile ad hoc networks”
Information Processing Letters
On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Tree-based key predistribution for wireless sensor networks
Wireless Networks
A high performance and intrinsically secure key establishment protocol for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Determining parameters of key predistribution schemes via linear codes in wireless sensor networks
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
On the security of wireless sensor networks
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
Wireless sensor networks are composed of a large number of randomly deployed sensor nodes with limited computing ability and memory space. These characteristics give rise to much challenge to key agreement. General key agreement schemes like KDC, PKI and the Diffie-Hellman key exchange schemes are not applicable to sensor networks. Recently several key distribution schemes have been proposed specifically for sensor networks, aimed to provide high connectivity and resilience while keeping low memory usage in the sensor nodes. In this paper, we formularize and analyze these methods, and deduce general conditions for a scheme to be optimal in terms of connectivity, resilience and memory usage. The result provides guideline to design optimal schemes. Based on the result, we proposed 2 schemes that can achieve optimal connectivity and resilience with the restriction of memory space.