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

The “Quantum Annoying” Property of Password-Authenticated Key Exchange Protocols

Edward Eaton, Douglas Stebila

Published Jan 1, 2021• 15 citations
Publisher
DOI
10.1007/978-3-030-81293-5_9

Related papers

On the Everlasting Security of Password-Authenticated Quantum Key Exchange.

Céline Chevalier, Marc Kaplan, Quoc-Huy Vu

arXiv:1904.01526•Apr 2, 2019•0 citations

Efficient Password Authenticated Key Exchange via Oblivious Transfer

Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan +1 more

Lecture notes in computer science•Jan 1, 2012•43 citations

Separating Standard and Asymmetric Password-Authenticated Key Exchange.

Julia Hesse

•Jan 1, 2019•3 citations

Quantum Safe Computation-Friendly Identity-Binding Password Authenticated Key Exchange

Pratima Jana, Ratna Dutta, Cong Zuo

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

Universal Composable Password Authenticated Key Exchange for the Post-Quantum World

You Lyu, Shengli Liu, Shuai Han

Lecture notes in computer science•Jan 1, 2024•10 citations

Two-Round Password-Based Authenticated Key Exchange from Lattices

Anqi Yin, Yuanbo Guo, Yuanming Song +2 more

Password-based authenticated key exchange (PAKE) allows participants sharing low-entropy passwords to agree on cryptographically strong session keys over insecure networks. In this paper, we present two PAKE protocols from lattices in the two-party and three-party settings, respectively, which can resist quantum attacks and achieve mutual authentication. The protocols in this paper achieve two rounds of communication by carefully utilizing the splittable properties of the underlying primitive, a CCA (Chosen-Ciphertext Attack)-secure public key encryption (PKE) scheme with associated nonadaptive approximate smooth projection hash (NA-ASPH) system. Compared with other related protocols, the proposed two-round PAKE protocols have relatively less communication and computation overhead. In particular, the two-round 3PAKE is more practical in large-scale communication systems.

Wireless Communications and Mobile Computing•Dec 14, 2020•7 citations
Password-based authenticated key exchange (PAKE) allows participants sharing low-entropy passwords to agree on cryptographically strong session keys over insecure networks. In this paper, we present two PAKE protocols from lattices in the two-party and three-party settings, respectively, which can resist quantum attacks and achieve mutual authentication. The protocols in this paper achieve two rounds of communication by carefully utilizing the splittable properties of the underlying primitive, a CCA (Chosen-Ciphertext Attack)-secure public key encryption (PKE) scheme with associated nonadaptive approximate smooth projection hash (NA-ASPH) system. Compared with other related protocols, the proposed two-round PAKE protocols have relatively less communication and computation overhead. In particular, the two-round 3PAKE is more practical in large-scale communication systems.