Universally composable contributory group key exchange

ABSTRACT

We treat the security of group key exchange (GKE) in the universal composability (UC) framework. Analyzing GKE protocols in the UC framework naturally addresses attacks by malicious insiders. We define an ideal functionality for GKE that captures contributiveness in addition to other desired security goals. We show that an efficient two-round protocol securely realizes the proposed functionality in the random oracle model. As a result, we obtain the most efficient UC-secure contributory GKE protocol known.

REFERENCES

• 1: M. Abdalla, D. Catalano, C. Chevalier, and D. Pointcheval. Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework. In Topics in Cryptology--CT-RSA'08, volume 4964 of LNCS, pages 335--351. Springer, 2008.
• 2: B. Barak, Y. Lindell, and T. Rabin. Protocol Initialization for the Framework of Universal Composability. Cryptology ePrint Archive, Report 2004/006, 2004.
• 3: M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated Key Exchange Secure against Dictionary Attacks. In Advances in Cryptology--EUROCRYPT'00, volume 1807 of LNCS, pages 139--155. Springer, 2000.
• 4: Mihir Bellare , Phillip Rogaway, Entity authentication and key distribution, Proceedings of the 13th annual international cryptology conference on Advances in cryptology, p.232-249, January 1994, Santa Barbara, California, United States
• 5: Jens-Matthias Bohli , María Isabel González Vasco , Rainer Steinwandt, Secure group key establishment revisited, International Journal of Information Security, v.6 n.4, p.243-254, June 2007 [doi>10.1007/s10207-007-0018-x]
• 6: C. Boyd and A. Mathuria. Protocols for Authentication and Key Establishment. Information Security and Cryptography. Springer, August 2003.
• 7: Emmanuel Bresson , Olivier Chevassut , David Pointcheval, Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case, Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, p.290-309, December 09-13, 2001
• 8: Emmanuel Bresson , Olivier Chevassut , David Pointcheval, Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions, Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology, p.321-336, May 02, 2002
• 9: Emmanuel Bresson , Olivier Chevassut , David Pointcheval , Jean-Jacques Quisquater, Provably authenticated group Diffie-Hellman key exchange, Proceedings of the 8th ACM conference on Computer and Communications Security, November 05-08, 2001, Philadelphia, PA, USA [doi>10.1145/501983.502018]
• 10: Emmanuel Bresson , Mark Manulis, Securing group key exchange against strong corruptions, Proceedings of the 2008 ACM symposium on Information, computer and communications security, March 18-20, 2008, Tokyo, Japan [doi>10.1145/1368310.1368347]
• 11: M. Burmester and Y. Desmedt. A Secure and Efficient Conference Key Distribution System (Extended Abstract). In EUROCRYPT, pages 275--286, 1994.
• 12: R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. Cryptology ePrint Archive, Report 2000/067, 2000. http://eprint.iacr.org/, Version updated on 13 Dec 2005.
• 13: Ran Canetti , Hugo Krawczyk, Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels, Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.453-474, May 06-10, 2001
• 14: Ran Canetti , Hugo Krawczyk, Security Analysis of IKE's Signature-Based Key-Exchange Protocol, Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology, p.143-161, August 18-22, 2002
• 15: Ran Canetti , Hugo Krawczyk, Universally Composable Notions of Key Exchange and Secure Channels, Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology, p.337-351, May 02, 2002
• 16: Ran Canetti , Yehuda Lindell , Rafail Ostrovsky , Amit Sahai, Universally composable two-party and multi-party secure computation, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada [doi>10.1145/509907.509980]
• 17: R. Canetti and T. Rabin. Universal Composition with Joint State. In Advances in Cryptology--CRYPTO'03, volume 2729 of LNCS, pages 265--281. Springer, 2003.
• 18: R Cleve, Limits on the security of coin flips when half the processors are faulty, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.364-369, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12168]
• 19: Y. Desmedt, J. Pieprzyk, R. Steinfeld, and H. Wang. A Non-malleable Group Key Exchange Protocol Robust Against Active Insiders. In Information Security--ISC'06, volume 4176 of LNCS, pages 459--475. Springer, 2006.
• 20: R. Dutta and R. Barua. Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting. IEEE Transactions on Information Theory, 54(5):2007--2025, May 2008.
• 21: Jun Furukawa , Frederik Armknecht , Kaoru Kurosawa, A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort, Proceedings of the 6th international conference on Security and Cryptography for Networks, September 10-12, 2008, Amalfi, Italy [doi>10.1007/978-3-540-85855-3_26]
• 22: D. Hofheinz and J. Müller-Quade. Universally Composable Commitments Using Random Oracles. In Theory of Cryptography---TCC'04, volume 2951 of LNCS, pages 58--76. Springer, 2004.
• 23: D. Hofheinz, J. Müller-Quade, and R. Steinwandt. Initiator-Resilient Universally Composable Key Exchange. In Computer Security - ESORICS'03, volume 2808 of LNCS, pages 61--84. Springer, 2003.
• 24: Jonathan Katz , Ji Sun Shin, Modeling insider attacks on group key-exchange protocols, Proceedings of the 12th ACM conference on Computer and communications security, November 07-11, 2005, Alexandria, VA, USA [doi>10.1145/1102120.1102146]
• 25: J. Katz and M. Yung. Scalable Protocols for Authenticated Group Key Exchange. In Advances in Cryptology--CRYPTO'03, volume 2729 of LNCS, pages 110--125. Springer, 2003.
• 26: H.-J. Kim, S.-M. Lee, and D. H. Lee. Constant-Round Authenticated Group Key Exchange for Dynamic Groups. In Advances in Cryptology--ASIACRYPT'04, volume 3329 of LNCS, pages 245--259. Springer, 2004.
• 27: M. Manulis. Provably Secure Group Key Exchange, volume 5 of IT Security. Europäischer Universitätsverlag, Berlin, Bochum, Dülmen, London, Paris, August 2007.
• 28: C. Mitchell, M. Ward, and P. Wilson. Key control in key agreement protocols. IEE Electronic Letters, 34(10):980--981, 1998.
• 29: J. Pieprzyk and H. Wang. Key Control in Multi-party Key Agreement Protocols. In Workshop on Coding, Cryptography and Combinatorics (CCC 2003), volume 23 of Progress in Computer Science and Applied Logic (PCS), pages 277--288, 2003.
• 30: D. Pointcheval. Provable Security for Public Key Schemes. In Contemporary Cryptology, pages 133--189. Birkhuser, 2005.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Data communications

General Terms:
Algorithms, Design, Security, Theory

Keywords:
contributiveness, group key exchange, universal composition