Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Secure and Efficient Group Key Agreements for Cluster Based Networks

  • Chapter
Transactions on Computational Science IV

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 5430))

Abstract

Ad hoc wireless networks offer anytime-anywhere networking services for infrastructure-free communication over the shared wireless medium. The proliferation of portable devices and ad hoc networks have led to the need for security services. This is illustrated daily in the media with reports of wireless network vulnerabilities. In this setting, secure group key agreement and efficient group key management are considered challenging tasks from both an algorithmic and computational point of view due to resource constraint in wireless networks. In this article, we present two dynamically efficient authenticated group key agreement protocols by reflecting ad hoc networks in a topology composed by a set of clusters. We analyse the complexity of the schemes and differentiate between the two approaches based on performance in a wireless setting. The proposed protocols avoid the use of a trusted third party (TTP) or a central authority, eliminating a single point attack. They allow easy addition and removal of nodes, and achieve better performance in comparison with the existing cluster based key agreements. Additionally, our proposed schemes are supported by sound security analysis in formal security models under standard cryptographic assumptions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abdel-Hafez, A., Miri, A., Oronzo-Barbosa, L.: Authenticated Group Key Agreement Protocols for Ad hoc Wireless Networks. Int. Journal of Network Security 4(1), 90–98 (2007)

    Google Scholar 

  2. Baker, D.J., Ephremides, A.: The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm. IEEE Transactions on Communications, COM-29(11), 1694–1701 (1981)

    Article  Google Scholar 

  3. Baker, D.J., Ephremides, A., Flynn, J.A.: The Design and Simulation of a Mobile Radio Network with Distributed Control. IEEE Journal on Selected Areas in Communications, 226–237 (1984)

    Google Scholar 

  4. Belding-Royer, E.M.: Hierarchical Routing in Ad hoc Mobile Networks. Wireless Communication & Mobile Computing 2(5), 515–532 (2002)

    Article  Google Scholar 

  5. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Bresson, E., Chevassut, O., Pointcheval, D.: Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 321–336. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Burmester, M., Desmedt, Y.: A Secure and Efficient Conference Key Distribution System. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275–286. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  9. Burmester, M., Desmedt, Y.: A Secure and Scalable Group Key Exchange System. Information Processing Letters 94(3), 137–143 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transaction on Information Theory, IT-22 (6), 644–654 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  11. Dutta, R., Barua, R., Sarkar, P.: Provably Secure Authenticated Tree Based Group Key Agreement. In: López, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 92–104. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Dutta, R., Barua, R.: Dynamic Group Key Agreement in Tree-based Setting. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 101–112. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Dutta, R., Barua, R.: Constant Round Dynamic Group Key Agreement. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 74–88. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Dutta, R., Barua, R.: Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting. IEEE Transactions on Information Theory 54(5), 2007–2025 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Dutta, R., Barua, R.: Overview of Key Agreement Protocols, http://eprint.iacr.org/2005/289

  16. Galbraith, S., Harrison, K., Soldera, D.: Implementing the Tate Pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324–337. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Gerla, M., Tsai, J.T.-C.: Multicluster, Mobile, Multimedia Radio Network. ACM Baltzer Journal of Wireless Networks 1(3), 255–265 (1995)

    Article  Google Scholar 

  18. Hietalahti, M.: Efficient Key Agreement for Ad Hoc Networks. Master’s Thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Espoo, Finland (2001)

    Google Scholar 

  19. Hietalahti, M.: A Clustering-based Group Key Agreement Protocol for Ad-Hoc Networks. Electronic Notes in Theoretical Computer Science 192, 43–53 (2008)

    Article  MATH  Google Scholar 

  20. Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385–394. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  21. Katz, J., Yung, M.: Scalable Protocols for Authenticated Group Key Exchange. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 110–125. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  22. Kim, Y., Perrig, A., Tsudik, G.: Tree Based Group Key Agreement. ACM Transactions on Information and System Security 7(1), 60–96 (2004)

    Article  Google Scholar 

  23. Konstantinou, E.: Cluster-based Group Key Agreement for Wireless Ad Hoc Networks. In: Proc. of IEEE ARES 2008, pp. 550–557 (2008)

    Google Scholar 

  24. Li, X., Wang, Y., Frieder, O.: Efficient Hybrid Key Agreement Protocol for Wireless Ad Hoc Networks. In: Proc. of IEEE International Conference on Computer Communications and Networks, pp. 404–409 (2002)

    Google Scholar 

  25. Lynn, B., Scott, M., Berreto, P.S.L.M., Lynn, H.Y.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–369. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  26. Manulis, M.: Security-Focused Survey on Group Key Exchange Protocols, http://eprint.iacr.org/2006/395

  27. Menezes, A., Van Oorschot, P.C., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  28. NIST. AES (December 2000), http://www.nist.gov/aes

  29. National Bureau of Standards. Data Encryption Standard, U.S. Department of Commerce, FIPS pub. 46 (1977)

    Google Scholar 

  30. Pei, G., Gerla, M., Hong, X., Chiang, C.C.: A Wireless Hierarchical Routing Protocol with Group Mobility. In: Proc. of IEEE WCNC 1999, pp. 1538–1542 (1999)

    Google Scholar 

  31. Scott, M.: Computing the Tate Pairing. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 293–304. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  32. Scott, M., Costigan, N., Abdulwahab, W.: Implementing Cryptographic Pairings on Smart Cards, http://www.iacr.org/2006/144

  33. Sucec, J., Marsic, I.: Clustering Overhead for Hierarchical Routing in Mobile Adhoc Networks. In: Proc. of IEEE Infocomm 2002, pp. 1698–1706 (2002)

    Google Scholar 

  34. Shi, H., He, M., Qin, Z.: Authenticated and Communication Efficient Group Key Agreement for Clustered Ah Hoc Networks. In: Pointcheval, D., Mu, Y., Chen, K. (eds.) CANS 2006. LNCS, vol. 4301, pp. 73–89. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  35. Steiner, M., Tsudik, G., Waidner, M.: Diffie-Hellman Key Distribution Extended to Group Communication. In: Proc. of ACM CCS 1996, pp. 31–37. ACM Press, New York (1996)

    Google Scholar 

  36. Yao, G., Ren, K., Bao, F., Deng, R.H., Feng, D.: Making the Key Agreement Protocol in Mobile Ad Hoc Network More Efficient. In: Zhou, J., Yung, M., Han, Y. (eds.) ACNS 2003. LNCS, vol. 2846, pp. 343–356. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Claude Shannon Institute Computer Science Department, NUI Maynooth, Co., Kildare, Ireland

    Ratna Dutta & Tom Dowling

Authors
  1. Ratna Dutta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tom Dowling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  2. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  3. University of Amazonas State - UEA Manaus, AM, Brazil

    Edward David Moreno

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dutta, R., Dowling, T. (2009). Secure and Efficient Group Key Agreements for Cluster Based Networks. In: Gavrilova, M.L., Tan, C.J.K., Moreno, E.D. (eds) Transactions on Computational Science IV. Lecture Notes in Computer Science, vol 5430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01004-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01004-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01003-3

  • Online ISBN: 978-3-642-01004-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation