Secure, accurate and precise time synchronization for wireless sensor networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
An Enhanced Trust Center Based Authentication in ZigBee Networks
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Brief announcement: lightweight key agreement and digital certificates for wireless sensor networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Tree-based key predistribution for wireless sensor networks
Wireless Networks
A new key-predistribution scheme for highly mobile sensor networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Key management for mobile sensor networks
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Sensor network security for pervasive e-health
Security and Communication Networks
| Hi-index | 0.00 |
Key management is paramount for mobile sensor network (MSN) security. Due to the characteristics of MSNs, key management must enable direct (without intermediaries) key establishment between two arbitrary nodes. We apply combinatorial design theory to pre-distribute Blundo's polynomials to MSN nodes. This approach is further combined with Liu and Ning polynomial evaluation optimization yet increasing the scalability of polynomials. It also solves the combinatorial design existence problem of Çamtepe and Yener key pre-distribution scheme (KPS) without a decrease in network scalability or resiliency. The analysis in this paper indicates that this scheme has a number of nice properties, including direct pairwise key establishment, which enables authentication, tolerance to node captures, increased scalability and very low computational and communication overhead.