Abstract
In this paper, we propose an improved alternative for the path key establishment phase of the bootstrapping protocol in a sensor network. This scheme has better connectivity than the path key establishment. The communication overhead for our scheme is comparable with that for the path key establishment. Moreover, the guarantee of good connectivity allows us to start with bigger key pools, thereby improving the resilience against node capture.
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.
References
Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 120–126 (1978)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22, 644–654 (1976)
Gamal, E.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469–472 (1985)
Brassard, G.: Modern Cryptology. Springer, New York (1988)
Stallings, W.: Cryptography and Network Security: Principles and Practices, 3rd edn. Prentice-Hall, Englewood Cliffs (2002)
Schaefer, E.: A simplified data encryption standard algorithm. In: Cryptologia (1996)
Merkle, R., Hellman, M.: On the security of multiple encryption. Communications of the ACM (1981)
Rivest, R.: The rc5 algorithm. Dr. Dobb’s Journal (1995)
Eschenaur, L., Gligor, V.D.: A key management scheme for distributed sensor networks. In: 9th ACM Conference on Computer and Communication Security, pp. 41–47 (2002)
Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: Proceedings of 10th ACM Conference on Computer and Communications Security (CCS), Washington DC, USA, pp. 52–61 (2003)
Chan, H., Perrig, A., Song, D.: Random key predistribution for sensor networks. In: IEEE Symposium on Security and Privacy, Berkely, California, pp. 197–213 (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), Washington DC, USA, pp. 42–51 (2003)
Du, W., Deng, J., Han, Y.S., Chen, S., Varshney, P.K.: A key management scheme for wireless sensor networks using deployment knowledge. In: 23rd Conference of the IEEE Communications Society (Infocom 2004), Hong Kong, China (2004)
Perrig, A., Szewczyk, R., Wen, V., Culler, D., Tygar, J.D.: Spins: Security protocols for sensor networks. In: Proceedings of the 7th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Rome, Italy, pp. 189–199 (2001)
Erdos, P., Renyi, A.: On random graphs. Publ. Math., 290–297 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, A.K. (2005). A Key Reshuffling Scheme for Wireless Sensor Networks. In: Jajodia, S., Mazumdar, C. (eds) Information Systems Security. ICISS 2005. Lecture Notes in Computer Science, vol 3803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11593980_15
Download citation
DOI: https://doi.org/10.1007/11593980_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30706-8
Online ISBN: 978-3-540-32422-5
eBook Packages: Computer ScienceComputer Science (R0)