SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Security: for ubiquitous computing
Security: for ubiquitous computing
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Proceedings of the 7th International Workshop on Security Protocols
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Key Infection: Smart Trust for Smart Dust
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Relaxed authenticity for data aggregation in wireless sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Correctness of sensor network applications by software bounded model checking
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Hi-index | 0.00 |
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up secret keys with his communication partners without the use of a central infrastructure. Most cited current research papers focus on a probabilistic distribution of sets of keys from larger key pools to new nodes. This results in unnecessary expensive communication and memory consumption, growing linearly with the size of the network, and guarantees secure connections only with a certain probability. This work presents a novel approach for efficient and secure key establishment of nodes joining the network by utilizing the fact that communication in sensor networks follows a paradigm called aggregation. Keys are split into shares and forwarded using disjoint paths in the network. The approach is self-organizing and minimizes memory consumption as well as radio transmissions efficiently -- down to logarithmic behavior.