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

(Password) Authenticated Key Establishment: From 2-Party to Group

Michel Ferreira Abdalla, Jens-Matthias Bohli, María Isabel González Vasco, Rainer Steinwandt

Published Jan 1, 2007• 47 citations
Publisher
DOI
10.1007/978-3-540-70936-7_27

Related papers

Password Authenticated Key Exchange Protocol in the Three Party Setting Based on Lattices

Mao Ye, Xuexian Hu, Wenfen Liu

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Feb 17, 2014•4 citations

Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness

Michel Ferreira Abdalla, Dario Catalano, Céline Chevalier +1 more

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

1 Password-Authenticated Constant-Round Group Key Establishment with a Common Reference String

Jens-Matthias Bohli, María Isabel González Vasco, González Vasco +1 more

Abstract. A provably secure password-authenticated protocol for group key establishment in the common reference string (CRS) model is presented. Our construction assumes the participating users to share a common password and combines projective hashing as introduced by Cramer and Shoup with a construction of Burmester and Desmedt. Our protocol is constant-round. Namely, it is a three-round protocol that can be seen as generalization of a two-party proposal of Gennaro and Lindell.

•Jul 25, 2013•27 citations

Protocols for Key Establishment and Authentication

Colin Boyd, Anish Mathuria

Springer eBooks•Aug 1, 2003•115 citations

Authenticated multi-party key agreement

Mike Just, Serge Vaudenay B

Lecture notes in computer science•Jan 1, 1996•201 citations

Group Key Establishment in a Quantum-Future Scenario

María Isabel González Vasco, Ángel Luis Pérez del Pozo, Rainer Steinwandt

In cryptography, key establishment protocols are often the starting point paving the way towards secure execution of different tasks. Namely, the parties seeking to achieve some cryptographic task, often start by establishing a common high-entropy secret that will eventually be used to secure their communication. In this paper, we put forward a security model for group key establishment ($\mathsf{GAKE}$) with an adversary that may execute efficient quantum algorithms, yet only once the execution of the protocol has concluded. This captures a situation in which keys are to be established in the present, while security guarantees must still be provided in the future when quantum resources may be accessible to a potential adversary. Further, we propose a protocol design that can be proven secure in this model. Our proposal uses password authentication and builds upon efficient and reasonably well understood primitives: a message authentication code and a post-quantum key encapsulation mechanism. The hybrid structure dodges potential efficiency downsides, like large signatures, of some “true” post-quantum authentication techniques, making our protocol a potentially interesting fit for current applications with long-term security needs.

Informatica•Jan 1, 2020•9 citations
In cryptography, key establishment protocols are often the starting point paving the way towards secure execution of different tasks. Namely, the parties seeking to achieve some cryptographic task, often start by establishing a common high-entropy secret that will eventually be used to secure their communication. In this paper, we put forward a security model for group key establishment (GAKE\mathsf{GAKE}GAKE) with an adversary that may execute efficient quantum algorithms, yet only once the execution of the protocol has concluded. This captures a situation in which keys are to be established in the present, while security guarantees must still be provided in the future when quantum resources may be accessible to a potential adversary. Further, we propose a protocol design that can be proven secure in this model. Our proposal uses password authentication and builds upon efficient and reasonably well understood primitives: a message authentication code and a post-quantum key encapsulation mechanism. The hybrid structure dodges potential efficiency downsides, like large signatures, of some “true” post-quantum authentication techniques, making our protocol a potentially interesting fit for current applications with long-term security needs.