Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, R., Chan, H., Perrig, A.: Key Infection: Smart Trust for Smart. In: IEEE International Conference on Network Protocols (ICNP 2004) (2004)
Eschenauer, L., Gligor, V.D.: A Key-Management Scheme for Distributed Sensor Networks, Conference on Computer and Communications Security. In: Proceedings of the 9th ACM conference on Computer and communications security 2002, Washington, DC, USA (2002)
Chan, H., Perrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: IEEE Symposium on Research and Privacy (2003)
Du, W., Deng, J., Han, Y.S., Varshney, P.K.: A Pairwise Key Pre-Distribution Scheme for wireless sensor networks. In: ACM conference on Computer and Communications Security (CCS) (2003)
Blom, R.: An Optimal Class of Symmetric Key Generation Systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)
Hwang, J.M., Kim, Y.D.: Revisiting Random Key Pre-distribution Schemes for Wireless Sensor Networks. In: SASN 2004, Washington, DC, USA (October 2004)
Szewxzyk, R., Osterwell, E., Polastre, J., Hamiltom, M., Mainwaring, A., Estrin, D.: Habitat Monitoring. Communication of the ACM 47(6) (June 2004)
Shi, E., Perrig, A.: Designing Secure Sensor Networks. IEEE Wireless Communications (December 2004)
Diffle, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-22(6) (November 1976)
Burrows, M., Abadi, M., Needham, R.: A Logic of Authentication. ACM Transactions Computer Systems (February 1990)
Boyd, C., Mathuira, A.: Protocols for Authentication and Key Establishment, pp. 59–62. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, YS., Han, SW., Nam, TY. (2006). Secure Rejoining Scheme for Dynamic Sensor Networks. In: Müller, G. (eds) Emerging Trends in Information and Communication Security. ETRICS 2006. Lecture Notes in Computer Science, vol 3995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11766155_8
Download citation
DOI: https://doi.org/10.1007/11766155_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34640-1
Online ISBN: 978-3-540-34642-5
eBook Packages: Computer ScienceComputer Science (R0)