| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Secure Group Communication Using Robust Contributory Key Agreement
May 2004 (vol. 15 no. 5)
pp. 468-480
Abstract—Contributory group key agreement protocols generate group keys based on contributions of all group members. Particularly appropriate for relatively small collaborative peer groups, these protocols are resilient to many types of attacks. Unlike most group key distribution protocols, contributory group key agreement protocols offer strong security properties such as key independence and perfect forward secrecy. This paper presents the first robust contributory key agreement protocol resilient to any sequence of group changes. The protocol, based on the Group Diffie-Hellman contributory key agreement, uses the services of a group communication system supporting Virtual Synchrony semantics. We prove that it provides both Virtual Synchrony and the security properties of Group Diffie-Hellman, in the presence of any sequence of (potentially cascading) node failures, recoveries, network partitions, and heals. We implemented a secure group communication service, Secure Spread, based on our robust key agreement protocol and Spread group communication system. To illustrate its practicality, we compare the costs of establishing a secure group with the proposed protocol and a protocol based on centralized group key management, adapted to offer equivalent security properties.
[1] 468 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, J. Schultz, J. Stanton, and G. Tsudik, Exploring Robustness in Group Key Agreement Proc. 21st IEEE Int'l Conf. Distributed Computing Systems, pp. 399-408, Apr. 2001.[3] A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. 1996.[4] K.P. Birman and T. Joseph, Exploiting Virtual Synchrony in Distributed Systems Proc. 11th Ann. Symp. Operating Systems Principles, pp. 123-138, Nov. 1987.[5] M. Steiner, G. Tsudik, and M. Waidner, Key Agreement in Dynamic Peer Groups IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 8, Aug. 2000.[6] Y. Amir and J. Stanton, The Spread Wide Area Group Communication System Johns Hopkins Univ., Center of Networking and Distributed Systems, Technical Report 98-4, 1998.[7] Y. Amir, C. Nita-Rotaru, and J. Stanton, Framework for Authentication and Access Control of Client-Server Group Communication Systems Proc. Third Int'l Workshop Networked Group Comm., Nov. 2001.[8] Y. Kim and G. Tsudik, Membership Control in Peer Groups Proc. Workshop New Directions on Scalable Cyber-Security, Mar. 2003.[9] Y. Kim, D. Mazzocchi, and G. Tsudik, Admission Control in Collaborative Groups Proc. Second IEEE Int'l Symp. Network Computing and Applications, Apr. 2003.[10] E. Bresson, O. Chevassut, and D. Pointcheval, Provably Authenticated Group Diffie-Hellman Key Exchange The Dynamic Case Proc. Asiacrypt, 2001.[11] 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, Nov. 2001.[12] 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.[13] A. Fekete, N. Lynch, and A. Shvartsman, Specifying and Using a Partitionable Group Communication Service ACM Trans. Computer Systems, vol. 19, no. 2, pp. 171-216, May 2001.[14] G.V. Chockler, I. Keidar, and R. Vitenberg, Group Communication Specifications: A Comprehensive Study ACM Computing Surveys, no. 4, pp. 427-469, Dec. 2001.[15] R. Friedman and R. van Renesse, Strong and Weak Virtual Synchrony in Horus Cornell Univ., Computer Science, Technical Report 95-1537, Aug. 1995.[16] J. Schultz, Partitionable Virtual Synchrony Using Extended Virtual Synchrony master's thesis, Dept. of Computer Science, Johns Hopkins Univ., Jan. 2001.[17] W. Diffie and M.E. Hellman, New Directions in Cryptography IEEE Trans. Information Theory, vol. 22, pp. 644-654, 1976.[18] G. Ateniese, O. Chevassut, D. Hasse, Y. Kim, and G. Tsudik, Design of a Group Key Agreement API Proc. DARPA Information Security Conf. and Exposition, Jan. 2000.[19] Y. Amir, Replication Using Group Communication over a Partitioned Network PhD dissertation, Inst. of Computer Science, The Hebrew Univ. of Jerusalem, Israel, 1995.[20] 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.[21] Y. Kim, A. Perrig, and G. Tsudik, Communication-Efficient Group Key Agreement Proc. Int'l Conf. Information Security IFIP SEC, June 2001.[22] D. Steer, L. Strawczynski, W. Diffie, and M. Wiener, A Secure Audio Teleconference System Proc. Conf. Advances in Cryptology, Aug. 1990.[23] M. Burmester and Y. Desmedt, A Secure and Efficient Conference Key Distribution System Proc. Conf. Advances in Cryptology, May 1994.[24] D. Boneh, The Decision Diffie-Hellman Problem Lecture Notes in Computer Science, vol. 1423, pp. 48-63, 1998.[25] H. Harney and C. Muckenhirn, Group Key Management Protocol (GKMP) Specification RFC 2093, July 1997.[26] T. Hardjono, B. Cain, and I. Monga, Intradomain Group Key Management Protocol Sept. 2000.[27] D. Harkins and N. Doraswamy, A Secure Scalable Multicast Key Management Protocol (MKMP) Nov. 1997.[28] T. Ballardie, Scalable Multicast Key Distribution RFC 1949, 1996.[29] D. Balenson, D. McGrew, and A. Sherman, Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization 2000.[30] H. Harney, A. Schuett, U. Meth, and A. Colegrove, GSAKMP Feb. 2003.[31] H. Harney, A. Schuett, and A. Colegrove, GSAKMP Light July 2002.[32] M. Baugher, T. Hardjono, H. Harney, and B. Weis, The Group Domain of Interpretation Dec. 2002.[33] M. Baugher, R. Canetti, L. Dondeti, and F. Lindholm, Group Key Management Architecture 2002.[34] W.-G. Tzeng and Z.-J. Tzeng, Round-Efficient Conference-Key Agreement Protocols with Provable Security Proc. Conf. Advances in Cryptology, Dec. 2000.[35] O. Rodeh, K. Birman, and D. Dolev, The Architecture and Performance of Security Protocols in the Ensemble Group Communication System ACM Trans. Information and System Security, vol. 4, no. 3, pp. 289-319, Aug. 2001.[36] O. Rodeh, K. Birman, and D. Dolev, Using AVL Trees for Fault Tolerant Group Key Management Cornell Univ., Computer Science, Technical Report 2000-45; Hebrew Univ., Computer Science, Technical Report 2000-1823, 2000.[37] K.P. Birman and R.V. Renesse, Reliable Distributed Computing with TheIsis Toolkit. IEEE Press, Mar. 1994.[38] Y. Amir et al., Transis:“A Communication Subsystem for High Availability,” Proc. Int’l Symp. Fault‐Tolerant Computing, IEEE CS Press, Los Alamitos, Calif., 1992, pp. 76‐84.[39] R.V. Renesse, K. Birman, and S. Maffeis, Horus: A Flexible Group Communication System Comm. ACM, vol. 39, pp. 76-83, Apr. 1996.[40] Y. Amir, L.E. Moser, P.M. Melliar-Smith, D. Agarwal, and P. Ciarfella, The Totem Single-Ring Ordering and Membership Protocol ACM Trans. Computer Systems, vol. 13, no. 4, pp. 311-342, Nov. 1995.[41] B. Whetten, T. Montgomery, and S. Kaplan, A High Performance Totally Ordered Multicast Protocol Proc. Theory and Practice in Distributed Systems, Int'l Workshop, p. 938, Sept. 1994.[42] T. Anker, G.V. Chockler, D. Dolev, and I. Keidar, Scalable Group Membership Services for Novel Applications Proc. Workshop Networks in Distributed Computing, 1998.[43] I. Keidar, K. Marzullo, J. Sussman, and D. Dolev, A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs Proc. 20th Int'l Conf. Distributed Computing Systems, pp. 356-365, Apr. 2000.[44] K.P. Kihlstrom, L.E. Moser, and P.M. Melliar-Smith, The SecureRing Protocols for Securing Group Communication Proc. IEEE 31st Hawaii Int'l Conf. System Sciences, pp. 317-326, Jan. 1998.[45] M.K. Reiter, Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart Proc. Second ACM Conf. Computer and Comm. Security, pp. 68-80, Nov. 1994.[46] M.A. Hiltunen and R.D. Schlichting, Adaptive Distributed and Fault-Tolerant Systems Int'l J. Computer Systems Science and Eng., vol. 11, no. 5, pp. 125-133, Sept. 1996.[47] M.A. Hiltunen, R.D. Schlichting, and C. Ugarte, Enhancing Survivability of Security Services Using Redundancy Proc. Int'l Conf. Dependable Systems and Networks, June 2001.[48] L. Gong, Enclaves: Enabling Secure Collaboration over the Internet IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 567-575, Apr. 1997.[49] P. McDaniel, A. Prakash, and P. Honeyman, Antigone: A Flexible Framework for Secure Group Communication Proc. Eighth USENIX Security Symp., pp. 99-114, Aug. 1999.
Index Terms:
Security and protection, fault tolerance, network protocols, distributed systems, group communication, contributory group key agreement, cryptographic protocols.
Citation:
Yair Amir, Yongdae Kim, Cristina Nita-Rotaru, John L. Schultz, Jonathan Stanton, Gene Tsudik, "Secure Group Communication Using Robust Contributory Key Agreement," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 5, pp. 468-480, May 2004, doi:10.1109/TPDS.2004.1278104
Usage of this product signifies your acceptance of the
Terms of Use.
|
|
|
|
|
|
|
|