An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
ACM Transactions on Computer Systems (TOCS)
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
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
Key Infection: Smart Trust for Smart Dust
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Revisiting random key pre-distribution schemes for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Protocols for Authentication and Key Establishment
Protocols for Authentication and Key Establishment
Designing secure sensor networks
IEEE Wireless Communications
Hi-index | 0.00 |
The establishment of cryptography keys is one of the challenging problems in the sensor networks. Key Infection [1] is a promising model to solve this problem on the commodity sensor networks without complex mechanism. This model, however, does not consider the mobility of sensors, so if sensor nodes move out of initial communication range, then they cannot rejoin the network. So, key infection model has been limited to the static sensor network. To be applied on the dynamic sensor network, therefore, key infection model has to be extended to handle node's rejoining. In this paper, we propose secure rejoining scheme for dynamic sensor networks and verify the proposed scheme formally. Our scheme is secure, since it uses old pair-wise key information to verify sensor node's rejoining. Furthermore, our scheme does not require additional verification information and maintains the reasonable number of links.