Abstract
Group key agreement protocols are designed to allow a group of parties communicating over a public network to agree on a session key in a secure manner. While a number of solutions have been proposed over the years, all of them are inadequate for a group where members are spread across a wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of messages sent, both of which are recognized as the dominant factors that severely slow down the protocols in wide area networks. In this paper we first present a communication-efficient group key agreement protocol and then prove its security against a passive adversary in the random oracle model under the factoring intractability assumption. The proposed protocol provides perfect forward secrecy and runs only in two communication rounds while achieving optimal message complexity. Therefore, the protocol is well suited for networking environments with high communication latency.
This work was supported by the University IT Research Center Project funded by the Korean Ministry of Information and Communication.
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
Amir, Y., Kim, Y., Nita-Rotaru, C., Tsudik, G.: On the Performance of Group Key Agreement Protocols. In: Proc. 22nd IEEE International Conference on Distributed Computing Systems, pp. 463–464 (2002), Full version available at http://www.cnds.jhu.edu/publications/
Ateniese, G., Steiner, M., Tsudik, G.: New multiparty authentication services and key agreement protocols. IEEE Journal on Selected Areas in Communications 18(4), 628–639 (2000)
Becker, K., Wille, U.: Communication complexity of group key distribution. In: Proc. 5th ACM Conf. on Computer and Communications Security (CCS 1998), pp. 1–6 (1998)
Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proc. 1st ACM Conf. on Computer and Communications Security (CCS 1993), pp. 62–73 (1993)
Biham, E., Boneh, D., Reingold, O.: Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring. Information Processing Letters (IPL) 70(2), 83–87 (1999)
Boyd, C., Nieto, J.M.G.: Round-optimal contributory conference key agreement. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 161–174. Springer, Heidelberg (2002)
Bresson, E., Chevassut, O., Pointcheval, D.: Provably authenticated group Diffie- Hellman key exchange — the dynamic case. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 290–309. Springer, Heidelberg (2001)
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)
Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.-J.: Provably authenticated group Diffie-Hellman key exchange. In: Proc. 8th ACM Conf. on Computer and Communications Security (CCS 2001), pp. 255–264 (2001)
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)
Ingemarsson, I., Tang, D., Wong, C.: A conference key distribution system. IEEE Trans. on Information Theory 28(5), 714–720 (1982)
Just, M., Vaudenay, S.: Authenticated multi-party key agreement. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 36–49. Springer, Heidelberg (1996)
Kim, Y., Perrig, A., Tsudik, G.: Simple and fault-tolerant key agreement for dynamic collaborative groups. In: Proc. 7th ACM Conf. on Computer and Communications Security (CCS 2000), pp. 235–244 (2000)
Kim, Y., Perrig, A., Tsudik, G.: Communication-efficient group key agreement. In: Proc. of International Federation for Information Processing — 16th International Conference on Information Security (IFIP SEC 2001), June 2001, pp. 229–244 (2001)
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)
Steer, D.G., Strawczynski, L., Diffie, W., Wiener, M.: A secure audio teleconference system. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 520–528. Springer, Heidelberg (1990)
Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE Trans. on Parallel and Distributed Systems 11(8), 769–780 (2000)
Tzeng, W.-G., 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nam, J., Cho, S., Kim, S., Won, D. (2004). Simple and Efficient Group Key Agreement Based on Factoring. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24707-4_76
Download citation
DOI: https://doi.org/10.1007/978-3-540-24707-4_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22054-1
Online ISBN: 978-3-540-24707-4
eBook Packages: Springer Book Archive