This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Group Key Agreement Efficient in Communication
July 2004 (vol. 53 no. 7)
pp. 905-921

Abstract—In recent years, collaborative and group-oriented applications and protocols have gained popularity. These applications typically involve communication over open networks; security thus is naturally an important requirement. Group key management is one of the basic building blocks in securing group communication. Most prior research in group key management focused on minimizing computation overhead, in particular minimizing expensive cryptographic operations. However, continued advances in computing power have not been matched by a decrease in network communication delay. Thus, communication latency, especially in high-delay long-haul networks, increasingly dominates the key setup latency, replacing computation delay as the main latency contributor. Hence, there is a need to minimize the size of messages and, especially, the number of rounds in cryptographic protocols. Since most previously proposed group key management techniques optimize computational (cryptographic) overhead, they are particularly impacted by high communication delay. In this work, we discuss and analyze a specific group key agreement technique which supports dynamic group membership and handles network failures, such as group partitions and merges. This technique is very communication-efficient and provably secure against hostile eavesdroppers as well as various other attacks specific to group settings. Furthermore, it is simple, fault-tolerant, and well-suited for high-delay networks.

[1] Y. Amir, G. Ateniese, D. Hasse, Y. Kim, C. Nita-Rotaru, T. Schlossnagle, J. Schultz, J. Stanton, and G. Tsudik, Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments Proc. 20th IEEE Int'l Conf. Distributed Computing Systems, pp. 330-343, Apr. 2000.
[2] Y. Amir, Y. Kim, C. Nita-Rotaru, and G. Tsudik, On the Performance of Group Key Agreement Protocols Technical Report CNDS-2001-5, The Johns Hopkins Univ.,http://www.cnds.jhu.edu/pub/paperscnds-2001-5.pdf , 2001.
[3] N. Asokan and P. Ginzboorg, Key-Agreement in Ad-Hoc Networks Proc. Nordsec '99, 1999.
[4] G. Ateniese, M. Steiner, and G. Tsudik, Authenticated Group Key Agreement and Friends Proc. Fifth ACM Conf. Computer and Comm. Security, pp. 17-26, Nov. 1998.
[5] C. Becker and U. Wille, Communication Complexity of Group Key Distribution Proc. Fifth ACM Conf. Computer and Comm. Security, Nov. 1998.
[6] M. Bellare and P. Rogaway, Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols Proc. First ACM Conf. Computer and Comm. Security, 1993.
[7] D. Boneh, The Decision Diffie-Hellman Problem Proc. Third Algorithmic Number Theory Symp., pp. 48-63, 1998.
[8] D. Boneh and A. Silverberg, Applications of Multilinear Forms to Cryptography Contemporary Math., to appear.
[9] E. Bresson, O. Chevassut, and D. Pointcheval, Provably Authenticated Group Diffie-Hellman Key Exchange The Dynamic Case Proc. Advances in Cryptology (ASIACRYPT 2001), C. Boyd, ed., 2001.
[10] E. Bresson, O. Chevassut, D. Pointcheval, and J.-J. Quisquater, Provably Authenticated Group Diffie-Hellman Key Exchange Proc. Eighth ACM Conf. Computer and Comm. Security, P. Samarati, ed., Nov. 2001.
[11] M. Burmester and Y. Desmedt, A Secure and Efficient Conference Key Distribution System Proc. Advances in Cryptology (EUROCRYPT '94), A. De Santis, ed., 1995.
[12] G. Caronni, M. Waldvogel, D. Sun, N. Weiler, and B. Plattner, The VersaKey Framework: Versatile Group Key Management IEEE J. Selected Areas in Comm., vol. 17, no. 9, Sept. 1999.
[13] D. Chaum, Zero-Knowledge Undeniable Signatures Proc. Advances in Cryptology (EUROCRYPT '90), I.B. Damgard, ed., pp. 458-464, May 1991.
[14] L. Dondeti, S. Mukherjee, and A. Samal, Disec: A Distributed Framework for Scalable Secure Many-to-Many Communication Proc. Fifth IEEE Symp. Computers and Comm. (ISCC 2000), July 2000.
[15] A. Fekete, N. Lynch, and A. Shvartsman, Specifying and Using a Partionable Group Communication Service Proc. 16th Ann. ACM Symp. Principles of Distributed Computing, pp. 53-62, Aug. 1997.
[16] I. Ingemarsson, D.T. Tang, and C.K. Wong, “A Conference Key Distribution System,” IEEE Trans. Information Theory, vol. 28, no. 5, pp. 714-720, 1982.
[17] A. Joux, A One Round Protocol for Tripartite Diffie-Hellman Proc. Fourth Int'l Algorithmic Number Theory Symp. (ANTS-IV), pp. 385-393, July 2000.
[18] Y. Kim, A. Perrig, and G. Tsudik, Simple and Fault-Tolerant Key Agreement for Dynamic Collaborative Groups Proc. Seventh ACM Conf. Computer and Comm. Security, pp. 235-244, Nov. 2000.
[19] Y. Kim, A. Perrig, and G. Tsudik, Communication-Efficient Group Key Agreement Information Systems Security, Proc. 17th Int'l Information Security Conf. IFIP SEC '01, 2001.
[20] D. McGrew and A. Sherman, Key Establishment in Large Dynamic Groups Using One-Way Function Trees manuscript, May 1998.
[21] A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1997.
[22] L.E. Moser, Y. Amir, P.M. Melliar-Smith, and D.A. Agarwal, "Extended Virtual Synchrony," Proc. 14th Int'l Conf. Distributed Computing Systems, pp. 56-65, June 1994.
[23] A. Perrig, Efficient Collaborative Key Management Protocols for Secure Autonomous Group Communication Proc. CrypTEC '99, pp. 192-202, 1999.
[24] O. Rodeh, K. Birman, and D. Dolev, Optimized Rekey for Group Communication Systems Proc. Symp. Network and Distributed Systems Security (NDSS '00), pp. 37-48, Feb. 2000.
[25] V. Shoup, Lower Bounds for Discrete Logarithms and Related Problems Proc. Advances in Cryptology (EUROCRYPT '97), W. Fumy, ed., pp. 256-266, 1997.
[26] V. Shoup, Using Hash Functions as a Hedge against Chosen Ciphertext Attacks Proc. Advances in Cryptology (EUROCRYPT 2000), B. Preneel, ed., pp. 275-288, 2000.
[27] D. Steer, L. Strawczynski, W. Diffie, and M. Wiener, A Secure Audio Teleconference System Advances in Cryptology (CRYPTO '88), pp. 520-528, Aug. 1988.
[28] M. Steiner, G. Tsudik, and M. Waidner, Cliques: A New Approach to Group Key Agreement IEEE Trans. Parallel and Distributed Systems, Aug. 2000.
[29] W.-G. Tzeng and Z.-J. Tzeng, Round-Efficient Conference-Key Agreement Protocols with Provable Security Proc. Advances in Cryptology (ASIACRYPT 2000), Dec. 2000.
[30] C. Wong, M. Gouda, and S. Lam, Secure Group Communications Using Key Graphs Proc. ACM SIGCOMM '98 Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 68-79, 1998, ACM SIGCOMM Computer Comm. Rev., vol. 28, no. 4, Oct. 1998.

Index Terms:
Security, group key agreement, group communication, communication complexity, cryptographic protocols.
Citation:
Yongdae Kim, Adrian Perrig, Gene Tsudik, "Group Key Agreement Efficient in Communication," IEEE Transactions on Computers, vol. 53, no. 7, pp. 905-921, July 2004, doi:10.1109/TC.2004.31
Usage of this product signifies your acceptance of the Terms of Use.