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

SoK: Game-Based Security Models for Group Key Exchange

Bertram Poettering, Paul Rösler, Jörg Schwenk, Douglas Stebila

Published Jan 1, 2021• 17 citations
Publisher
DOI
10.1007/978-3-030-75539-3_7

Related papers

Falsifiability, Composability, and Comparability of Game-Based Security Models for Key Exchange Protocols

Chris Brzuska, Cas J. F. Cremers, Håkon Jacobsen +2 more

Lecture notes in computer science•Jan 1, 2025•1 citation

SoK: Post-Quantum Key Encapsulation Mechanisms—Security Definitions, Constructions, and Applications

Biming Zhou, Yiting Liu, Haodong Jiang +1 more

Lecture notes in computer science•Jan 1, 2025•1 citation

A new strong security model for stateful authenticated group key exchange

Zheng Yang, Chao Liu, Wanping Liu +2 more

International Journal of Information Security•Apr 17, 2017•4 citations

On Security Models and Compilers for Group Key Exchange Protocols

Emmanuel Bresson, Mark Manulis, Jörg Schwenk

Springer eBooks•Sep 21, 2007•37 citations

Witness-Authenticated Key Exchange, Revisited: Extensions to Groups, Improved Models, Simpler Constructions

Matteo Campanelli, Rosario Gennaro, Kelsey Melissaris +1 more

We study witness-authenticated key exchange (WAKE), in which parties authenticate through knowledge of a witness to any NP statement. WAKE achieves generic authenticated key exchange in the absence of trusted parties; WAKE is most suitable when a certificate authority is either unavailable or undesirable, as in highly decentralized networks. In practice WAKE approximates witness encryption, its elusive non-interactive analogue, at the cost of minimal interaction. This work is the first to propose, model and build witness-authenticated key exchange amongst groups of more than two parties, as well as the first to provide practical and provably secure constructions in the two-party case for general NP statements. Specifically our contributions are: both game-based and universally composable (Canetti, FOCS ’01) definitions for WAKE along with equivalence conditions between the two definitions, a highly general compiler that introduces witness-authentication to any key exchange protocol along with, as a direct consequence, a three-round group WAKE protocol from DDH and signatures of knowledge (SOK), and an optimized two-round group WAKE construction from DDH and SOK along with experimental benchmarks to demonstrate concrete practicality. Additionally, we study the specialized two-party case and provide a critique of prior work on this topic (Ngo et al., Financial Crypto ’21) by pinpointing nontrivial weaknesses in the model, constructions and security proofs seen therein. We rectify those limitations with this work, significantly diverging in our techniques, design and approach.

Lecture notes in computer science•Nov 30, 2023•0 citations

SoK: Public Key Encryption with Openings

Carlo Brunetta, Hans Heum, Martijn Stam

Lecture notes in computer science•Jan 1, 2024•5 citations
We study witness-authenticated key exchange (WAKE), in which parties authenticate through knowledge of a witness to any NP statement. WAKE achieves generic authenticated key exchange in the absence of trusted parties; WAKE is most suitable when a certificate authority is either unavailable or undesirable, as in highly decentralized networks. In practice WAKE approximates witness encryption, its elusive non-interactive analogue, at the cost of minimal interaction. This work is the first to propose, model and build witness-authenticated key exchange amongst groups of more than two parties, as well as the first to provide practical and provably secure constructions in the two-party case for general NP statements. Specifically our contributions are: both game-based and universally composable (Canetti, FOCS ’01) definitions for WAKE along with equivalence conditions between the two definitions, a highly general compiler that introduces witness-authentication to any key exchange protocol along with, as a direct consequence, a three-round group WAKE protocol from DDH and signatures of knowledge (SOK), and an optimized two-round group WAKE construction from DDH and SOK along with experimental benchmarks to demonstrate concrete practicality. Additionally, we study the specialized two-party case and provide a critique of prior work on this topic (Ngo et al., Financial Crypto ’21) by pinpointing nontrivial weaknesses in the model, constructions and security proofs seen therein. We rectify those limitations with this work, significantly diverging in our techniques, design and approach.