Password-Based group key exchange in a constant number of rounds

  • Authors:
  • Michel Abdalla;Emmanuel Bresson;Olivier Chevassut;David Pointcheval

  • Affiliations:
  • Departement d'Informatique, École normale supérieure, Paris, France;Cryptology Department, CELAR, Bruz, France;Lawrence Berkeley National Laboratory, Berkeley, CA;Departement d'Informatique, École normale supérieure, Paris, France

  • Venue:
  • PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the development of grids, distributed applications are spread across multiple computing resources and require efficient security mechanisms among the processes. Although protocols for authenticated group Diffie-Hellman key exchange protocols seem to be the natural mechanisms for supporting these applications, current solutions are either limited by the use of public key infrastructures or by their scalability, requiring a number of rounds linear in the number of group members. To overcome these shortcomings, we propose in this paper the first provably-secure password-based constant-round group key exchange protocol. It is based on the protocol of Burmester and Desmedt and is provably-secure in the random-oracle and ideal-cipher models, under the Decisional Diffie-Hellman assumption. The new protocol is very efficient and fully scalable since it only requires four rounds of communication and four multi-exponentiations per user. Moreover, the new protocol avoids intricate authentication infrastructures by relying on passwords for authentication.