A Key Reshuffling Scheme for Wireless Sensor Networks

  • Ashok Kumar Das
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3803)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22, 644–654 (1976)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Gamal, E.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469–472 (1985)MATHCrossRefGoogle Scholar
  4. 4.
    Brassard, G.: Modern Cryptology. Springer, New York (1988)MATHGoogle Scholar
  5. 5.
    Stallings, W.: Cryptography and Network Security: Principles and Practices, 3rd edn. Prentice-Hall, Englewood Cliffs (2002)Google Scholar
  6. 6.
    Schaefer, E.: A simplified data encryption standard algorithm. In: Cryptologia (1996)Google Scholar
  7. 7.
    Merkle, R., Hellman, M.: On the security of multiple encryption. Communications of the ACM (1981)Google Scholar
  8. 8.
    Rivest, R.: The rc5 algorithm. Dr. Dobb’s Journal (1995)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    Erdos, P., Renyi, A.: On random graphs. Publ. Math., 290–297 (1959)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ashok Kumar Das
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyKharagpurIndia

Personalised recommendations