Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Provably Authenticated Group Diffie-Hellman Key Exchange — The Dynamic Case

Emmanuel Bresson, Olivier Chevassut, David Pointcheval

Published Jan 1, 2001• 246 citations
Publisher
DOI
10.1007/3-540-45682-1_18

Related papers

Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions

Emmanuel Bresson, Olivier Chevassut, David Pointcheval

Lecture notes in computer science•Jan 1, 2002•221 citations

Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem.

Hai Huang, Zhenfu Cao

•Jan 1, 2008•30 citations

Fully Robust Tree-Diffie-Hellman Group Key Exchange

Timo Brecher, Emmanuel Bresson, Mark Manulis

Lecture notes in computer science•Jan 1, 2009•20 citations

An Authenticated Key Exchange with Perfect Forward Secrecy for Two Message Diffie-Hellman Type Protocols

Tribid Debbarma, Anupam Jamatia, Kunal Chakma

Lecture Notes on Software Engineering•Nov 13, 2014•0 citations

Provably authenticated group Diffie-Hellman key exchange - The dynamic case (Extended abstract)

Emmanuel Bresson, Olivier Chevassut, David Pointcheval

Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange(AKE) are designed to work in scenario in which the group membership is not known in advance but where parties may join and may also leave the multicast group at any given time. While several schemes have been proposed to deal with this scenario no formal treatment for this cryptographic problem has ever been suggested. In this paper, we define a security model for this problem and use it to precisely define Authenticated Key Exchange (AKE) with ''implicit'' authentication as the fundamental goal, and the entity-authentication goal as well. We then define in this model the execution of a protocol modified from a dynamic group Diffie-Hellman scheme offered in the literature and prove its security.

International Conference on the Theory and Application of Cryptology and Information Security•Sep 20, 2001•13 citations

Signed Diffie-Hellman Key Exchange with Tight Security

Jiaxin Pan, Chen Qian, Magnus Ringerud

Lecture notes in computer science•Jan 1, 2021•12 citations
Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange(AKE) are designed to work in scenario in which the group membership is not known in advance but where parties may join and may also leave the multicast group at any given time. While several schemes have been proposed to deal with this scenario no formal treatment for this cryptographic problem has ever been suggested. In this paper, we define a security model for this problem and use it to precisely define Authenticated Key Exchange (AKE) with ''implicit'' authentication as the fundamental goal, and the entity-authentication goal as well. We then define in this model the execution of a protocol modified from a dynamic group Diffie-Hellman scheme offered in the literature and prove its security.