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

On the Privacy-Preserving Infrastructure for Authenticated Key Exchange

Li Duan, Yong Li

Published Jan 1, 2023• 2 citations
Publisher
DOI
10.1007/978-3-031-49187-0_22

Related papers

Privacy-Preserving Authenticated Key Exchange: Stronger Privacy and Generic Constructions

Sebastian Ramacher, Daniel Slamanig, Andreas Weninger

Lecture notes in computer science•Jan 1, 2021•9 citations

Privacy-Preserving Authenticated Key Exchange and the Case of IKEv2

Sven Schäge, Jörg Schwenk, Sebastian Lauer

Lecture notes in computer science•Jan 1, 2020•21 citations

Privacy-Preserving Authenticated Key Exchange in the Standard Model

You Lyu, Shengli Liu, Shuai Han +1 more

Lecture notes in computer science•Jan 1, 2022•9 citations

Privacy-Preserving Authenticated Key Exchange for Constrained Devices

Loïc Ferreira

Lecture notes in computer science•Jan 1, 2022•6 citations

Privacy-Preserving Certificate-Less Authenticated Key Exchange with Key Registration Privacy

Li Duan, Yong Li

Lecture notes in computer science•Jan 1, 2025•0 citations

Round-Optimal Authenticated Key Exchange with Full Forward Privacy

Koki Matsui, Shoma Kanzaki, Wakaha Ogata +1 more

Privacy-preserving authenticated key exchange (PPAKE) is a cryptographic protocol that enables two users to exchange a session key while protecting users' privacy (i.e., hiding the user's identity) against the machine-in-the-middle adversary. To hide user identities, PPAKE messages are broadcast to the network, increasing communication complexity. In ASIACRYPT2022, Lyu et al. introduced a concept of robustness to reduce communication complexity. Roughly, robust PPAKE allows receivers to decide whether it is the intended user by processing the first message with its long-term secret key. As a result, only the intended user replies to the first message, and thus, messages in the network are reduced. However, if a user's secret key is leaked, an adversary can also use it to determine whether the past first message was intended for the user, and thus, the PPAKE scheme of Lyu et al. does not have full forward privacy. Lyu et al. leave an open problem of constructing a PPAKE scheme with robustness and full forward privacy. In this work, we solve this problem by introducing a new framework called key updatable PPAKE (kuPPAKE). In kuPPAKE schemes, a long-term secret key is updated so that the updated key does not work for past messages. Therefore, robustness no longer conflicts with full forward privacy. We propose a generic construction of a 2-round kuPPAKE and show a concrete scheme in the standard model from DH-style assumptions over bilinear groups.

IACR Communications in Cryptology•Jul 7, 2025•0 citations
Privacy-preserving authenticated key exchange (PPAKE) is a cryptographic protocol that enables two users to exchange a session key while protecting users' privacy (i.e., hiding the user's identity) against the machine-in-the-middle adversary. To hide user identities, PPAKE messages are broadcast to the network, increasing communication complexity. In ASIACRYPT2022, Lyu et al. introduced a concept of robustness to reduce communication complexity. Roughly, robust PPAKE allows receivers to decide whether it is the intended user by processing the first message with its long-term secret key. As a result, only the intended user replies to the first message, and thus, messages in the network are reduced. However, if a user's secret key is leaked, an adversary can also use it to determine whether the past first message was intended for the user, and thus, the PPAKE scheme of Lyu et al. does not have full forward privacy. Lyu et al. leave an open problem of constructing a PPAKE scheme with robustness and full forward privacy. In this work, we solve this problem by introducing a new framework called key updatable PPAKE (kuPPAKE). In kuPPAKE schemes, a long-term secret key is updated so that the updated key does not work for past messages. Therefore, robustness no longer conflicts with full forward privacy. We propose a generic construction of a 2-round kuPPAKE and show a concrete scheme in the standard model from DH-style assumptions over bilinear groups.