Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions

  • Emmanuel Bresson
  • Olivier Chevassut
  • David Pointcheval
Conference paper

DOI: 10.1007/3-540-46035-7_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2332)
Cite this paper as:
Bresson E., Chevassut O., Pointcheval D. (2002) Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions. In: Knudsen L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg

Abstract

Authenticated Diffie-Hellman key exchange allows two principals communicating over a public network, and each holding public/private keys, to agree on a shared secret value. In this paper we study the natural extension of this cryptographic problem to a group of principals. We begin from existing formal security models and refine them to incorporate major missing details (e.g., strong-corruption and concurrent sessions). Within this model we define the execution of a protocol for authenticated dynamic group Diffie-Hellman and show that it is provably secure under the decisional Diffie-Hellman assumption. Our security result holds in the standard model and thus provides better security guarantees than previously published results in the random oracle model.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Emmanuel Bresson
    • 1
  • Olivier Chevassut
    • 2
    • 3
  • David Pointcheval
    • 1
  1. 1.École normale supérieureParis Cedex 05France
  2. 2.Lawrence Berkeley National LaboratoryBerkeleyUSA
  3. 3.Université Catholique de LouvainLouvain-la-NeuveBelgium

Personalised recommendations