(Password) authenticated key establishment: from 2-party to group

  • Authors:
  • Michel Abdalla;Jens-Matthias Bohli;María Isabel González Vasco;Rainer Steinwandt

  • Affiliations:
  • Departement d'Informatique, École Normale Supérieure, CNRS, Paris Cedex 05, France;Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, Karlsruhe, Germany;Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain;Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL

  • Venue:
  • TCC'07 Proceedings of the 4th conference on Theory of cryptography
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment with 2 more rounds of communication. The compiler introduces neither idealizing assumptions nor high-entropy secrets, e. g., for signing. In particular, applying the compiler to a password-authenticated 2-party key establishment without random oracle assumption, yields a password-authenticated group key establishment without random oracle assumption. Our main technical tools are non-interactive and non-malleable commitment schemes that can be implemented in the common reference string (CRS) model.