Advertisement

An Efficient Protocol for Authenticated Group Key Agreement in Heterogeneous Networks

  • Mounita Saha
  • Dipanwita RoyChowdhury
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 130)

Abstract

With the advent of wireless and ubiquitous computing, group communication in heterogeneous environment is gaining popularity. Although a number of protocols for group key agreement exist in the literature, most of them are not applicable in heterogeneous environment where a number of computationally limited nodes coexist with one or more computationally efficient nodes. Among the few existing protocols, where some fail to satisfy the key agreement properties, some are unable to handle the agreement for dynamic group. In this work, we propose a constant round group key agreement protocol for heterogeneous environment using polynomial interpolation. The protocol ensures both communication and computation efficiency by shifting the major computation load on powerful users, achieves true contributory key agreement property and dynamic handling of user join and leave. The security of the protocol has been analyzed under formal model. The comparison result shows considerable improvement in protocol efficiency compared to the existing ones.

Keywords

Group key agreement Heterogeneous network Resource-constrained environment Hierarchical key agreement Provable security 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boyd, C., Nieto, J.: Round-optimal contributory conference key agreement. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 161–174. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Bresson, E., Catalano, D.: Constant round authenticated group key agreement via distributed computation. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 115–129. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Becker, K., Wille, U.: Communication complexity of group key distribution. In: 5th ACM Conf. on Computer and Communications Security, pp. 1–6 (1998)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Bresson, E., Chevassut, O., Pointcheval, D.: Mutual authentication and group key agreement for low-power mobile devices. Computer Communications 27, 1730–1737 (2004)CrossRefGoogle Scholar
  6. 6.
    Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.: Provably authenticated group diffie-hellman key exchange. In: 8th ACM Conf. on Computer and Communications Security, pp. 255–264 (2001)Google Scholar
  7. 7.
    Ateniese, G., Tsudik, G.: New multiparty authentication services and key agreement protocols. IEEE Journal on Selected Areas in Communications 18, 628–639 (2000)CrossRefGoogle Scholar
  8. 8.
    Hwang, K., Chang, C.: A self-encryption mechanism for authentication of roaming and teleconference services. IEEE Transaction on Wireless Communications 2, 400–407 (2003)CrossRefGoogle Scholar
  9. 9.
    Ingermarsson, I., Wong, C.: A conference key distribution system. IEEE Trans. on Information Theory 28, 714–720 (1982)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Nam, J., Kim, S., Won, D.: A weakness in the. bresson-chevassut-essiari-pointcheval’s group key agreement scheme for low-power mobile devices. IEEE Communications Letters 9, 429–431 (2005)CrossRefGoogle Scholar
  11. 11.
    Nam, J., Lee, J., Kim, S., Won, D.: DDH-based group key agreement in a mobile environment. Journal of Systems and Software 78, 73–83 (2005)CrossRefGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Tseng, Y.: A resource-constrained group key agreement protocol for imbalanced wireless networks. Computers and Security 26, 331–337 (2007)CrossRefGoogle Scholar
  14. 14.
    Tzeng, W., Tzeng, Z.-J.: Round-efficient conference key agreement protocols with provable security. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 614–627. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  15. 15.
    Jiang, Y., Lin, C., Shi, M., Shen, X.S.: A self-encryption authentication protocol for teleconference services. International Journal of Security and Networks 1, 198–205 (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Mounita Saha
    • 1
  • Dipanwita RoyChowdhury
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyKharagpurIndia

Personalised recommendations