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

International Conference on Big Data, Information and Computer Network (BDICN)

Anonymous Password-Authenticated Key Exchange Protocol Based on Lattice

Yun Song, Songhui Guo, Ruiyang Ding

Published Jan 1, 2023• 5 citations
Publisher

Abstract

As the security of password authenticated key exchange protocols based on traditional public key cryptosystems is threatened by quantum computing, the research on password authenticated key exchange protocols that can resist quantum computing attacks has become a hot spot of current research. At present, the anonymity of anonymous PAKE protocol is generally linkable, and cannot completely protect the user’s identity privacy information. This paper proposes a two-party password authenticated key exchange protocol with anonymity based on SPHF from ideal lattice, and gives a strict security proofunder the BPR model. The security and performance analysis proves that the proposed protocol has good advantages in communication costs and security.

DOI
10.1109/bdicn58493.2023.00078

Related papers

A provably secure authenticated key exchange protocol based on lattice with stronger anonymity

Yun Song, Songhui Guo, Yeming Yang +1 more

Stronger anonymity password authentication key exchange protocols based on traditional cryptography are not resistant to quantum computing attacks, and there is no lattice-only anonymous password authentication key exchange protocol protocol that satisfies the strong anonymity requirement. Therefore, this paper constructs stronger anonymity PAKE protocol based on the ring learning with errors (RLWE) and smooth projective hash function (SPHF) based on ideal lattice. The proposed protocol can achieve stronger anonymity and resists to desynchronization attacks and quantum attack. The security of the protocol is proved under the BPR model. The security and performance analysis shows that the proposed PAKE protocol has better advantages in security and efficiency.

International Conference on Cryptography, Network Security and Communication Technology (CNSCT)•May 12, 2023•1 citation

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

A Construction of Three Party Post Quantum Secure Authenticated Key Exchange Using Ring Learning With Errors and ECC Cryptography

Dharminder Chaudhary, Uddeshaya Kumar, Kashif Saleem

A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server over public channel. Shor’s algorithm is a big threat for existing authenticated key exchange protocols. Lattice based cryptography plays a very important role in designing authentication and key agreement secure against the threat of quantum attacks. However, it is not easy job to design quantum resistant password based three party protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a new post quantum three party key exchange based on ring learning with errors assumption. This protocol is motivated from Islam et al.’s authenticated key exchange protocol. Their protocol is not secure against stolen smartcard attack, password guessing attack, and can’t provide user anonymity. The anonymous communication is a big requirement for practical applications like e-healthcare services/smart vehicular communication. This paper also contains the performance analysis of the proposed protocol along with other relevant protocols.

IEEE Access•Jan 1, 2023•40 citations

Three-Party Password Authentication and Key Exchange Protocol Based on MLWE

Songhui Guo, Yun Song, Song Guo +2 more

With the rapid development of quantum theory, the discrete logarithm problem and significant integer factorization problem have polynomial solution algorithms under quantum computing, and their security is seriously threatened. Therefore, a three-party password-authenticated key agreement scheme based on module learning with errors problem was proposed, and its security was proved in the BPR model. Compared with other password-authenticated key agreement protocols, the proposed protocol has higher efficiency and a shorter key length, which can resist quantum attacks. Therefore, the protocol is efficient and secure and suitable for large-scale network communication.

Symmetry•Sep 13, 2023•13 citations

Post-Quantum Anonymity of Key Encapsulation Mechanism and Its Applications in Password Authenticated Key Exchange Protocols

JiaYv An, Yankun Gao, Lei Han

Driven by advances in the standardization of NIST’s Post-Quantum Cryptography (PQC) algorithms, research on constructing Password Authenticated Key Exchange (PAKE) protocols using Key Encapsulation Mechanisms (KEMs) has gained considerable attention. Several PAKE protocols have established precise security requirements for the underlying KEM. Arriaga et al. introduced a PAKE protocol called CHIC, which requires the KEM to achieve anonymity under plaintext-checkable attacks (ANO-1PCA). An anonymous KEM does not leak any information about which public key was used for encryption. It protects the identities and privacy of participants and is critical in preventing identity-guessing attacks, therefore, anonymity is also called key-privacy. The anonymity of NIST PQC Round-3 candidates has recently been analyzed, some of which satisfied ANO-CCA.Huguenin-Dumittan and Vaudenay proposed two efficient constructions, TCHand TH, to create KEM from public-key encryption (PKE) schemes. Jiang et al. introduced TRHbased on TH. These constructions can transform any OW-CPA PKE into an IND-qCCA KEM efficiently and avoid re-encryption. However, prior to this work, no research has been conducted to determine whether these constructions preserve or lift anonymity.In this paper, we proved that for any OW-CPA, DS-IND PKE, the construction KEMRH= TRH[PKE,H] achieves ANO1-CCA in the quantum random oracle model (QROM). We then construct a KEM called KyberRH, and provide an algorithm for the CHIC protocol using KyberRH.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Nov 14, 2025•1 citation

High-Performing Quantum-Safe Password-Authenticated Key Exchange for Mobile Devices

Peixin Ren, Xiaozhuo Gu, Kaibo Liu

The Password-Authenticated Key Exchange (PAKE) protocol is a useful tool for establishing secure remote communication between users, especially given the prevalence of amplifying a human-memorable password into a strong session key in the age of hand-held devices. Recent advances in quantum computing have stimulated interest in quantum-safe cryptographic schemes. Therefore, we propose QSPAK and QSPPK, two post-quantum and efficient PAKE protocols which are parallel extensions of PAK and PPK, but based on the hardness assumption over module lattices. Specifically, we make a comprehensive trade-off among multiple significant performance indicators such as the post-quantum security, the failure rate, the communication cost and the running time to guide optimal parameter choices. This rigorous instantiation has never been seen in previous PAKE papers. Additionally, utilizing the flexibility of module lattices, we provide three parameter sets (#1, #2, and #3) matching different security scenarios. We implement and benchmark QSPAK and QSPPK against other competitive proposals. The performance results indicate that our QSPAK and QSPPK, besides being more efficient, exhibit the flexibility and security advantages over the latter schemes. Furthermore, we construct a post-quantum password-authenticated TLS 1.3 framework, aimed towards provide a further suggestion for IETF standardization of quantum-safe PAKE.

International Conference on Generative Artificial Intelligence and Information Security (GAIIS)•Mar 27, 2026•0 citations
As the security of password authenticated key exchange protocols based on traditional public key cryptosystems is threatened by quantum computing, the research on password authenticated key exchange protocols that can resist quantum computing attacks has become a hot spot of current research. At present, the anonymity of anonymous PAKE protocol is generally linkable, and cannot completely protect the user’s identity privacy information. This paper proposes a two-party password authenticated key exchange protocol with anonymity based on SPHF from ideal lattice, and gives a strict security proofunder the BPR model. The security and performance analysis proves that the proposed protocol has good advantages in communication costs and security.
Stronger anonymity password authentication key exchange protocols based on traditional cryptography are not resistant to quantum computing attacks, and there is no lattice-only anonymous password authentication key exchange protocol protocol that satisfies the strong anonymity requirement. Therefore, this paper constructs stronger anonymity PAKE protocol based on the ring learning with errors (RLWE) and smooth projective hash function (SPHF) based on ideal lattice. The proposed protocol can achieve stronger anonymity and resists to desynchronization attacks and quantum attack. The security of the protocol is proved under the BPR model. The security and performance analysis shows that the proposed PAKE protocol has better advantages in security and efficiency.
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.
A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server over public channel. Shor’s algorithm is a big threat for existing authenticated key exchange protocols. Lattice based cryptography plays a very important role in designing authentication and key agreement secure against the threat of quantum attacks. However, it is not easy job to design quantum resistant password based three party protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a new post quantum three party key exchange based on ring learning with errors assumption. This protocol is motivated from Islam et al.’s authenticated key exchange protocol. Their protocol is not secure against stolen smartcard attack, password guessing attack, and can’t provide user anonymity. The anonymous communication is a big requirement for practical applications like e-healthcare services/smart vehicular communication. This paper also contains the performance analysis of the proposed protocol along with other relevant protocols.
With the rapid development of quantum theory, the discrete logarithm problem and significant integer factorization problem have polynomial solution algorithms under quantum computing, and their security is seriously threatened. Therefore, a three-party password-authenticated key agreement scheme based on module learning with errors problem was proposed, and its security was proved in the BPR model. Compared with other password-authenticated key agreement protocols, the proposed protocol has higher efficiency and a shorter key length, which can resist quantum attacks. Therefore, the protocol is efficient and secure and suitable for large-scale network communication.
Driven by advances in the standardization of NIST’s Post-Quantum Cryptography (PQC) algorithms, research on constructing Password Authenticated Key Exchange (PAKE) protocols using Key Encapsulation Mechanisms (KEMs) has gained considerable attention. Several PAKE protocols have established precise security requirements for the underlying KEM. Arriaga et al. introduced a PAKE protocol called CHIC, which requires the KEM to achieve anonymity under plaintext-checkable attacks (ANO-1PCA). An anonymous KEM does not leak any information about which public key was used for encryption. It protects the identities and privacy of participants and is critical in preventing identity-guessing attacks, therefore, anonymity is also called key-privacy. The anonymity of NIST PQC Round-3 candidates has recently been analyzed, some of which satisfied ANO-CCA.Huguenin-Dumittan and Vaudenay proposed two efficient constructions, TCHand TH, to create KEM from public-key encryption (PKE) schemes. Jiang et al. introduced TRHbased on TH. These constructions can transform any OW-CPA PKE into an IND-qCCA KEM efficiently and avoid re-encryption. However, prior to this work, no research has been conducted to determine whether these constructions preserve or lift anonymity.In this paper, we proved that for any OW-CPA, DS-IND PKE, the construction KEMRH= TRH[PKE,H] achieves ANO1-CCA in the quantum random oracle model (QROM). We then construct a KEM called KyberRH, and provide an algorithm for the CHIC protocol using KyberRH.
The Password-Authenticated Key Exchange (PAKE) protocol is a useful tool for establishing secure remote communication between users, especially given the prevalence of amplifying a human-memorable password into a strong session key in the age of hand-held devices. Recent advances in quantum computing have stimulated interest in quantum-safe cryptographic schemes. Therefore, we propose QSPAK and QSPPK, two post-quantum and efficient PAKE protocols which are parallel extensions of PAK and PPK, but based on the hardness assumption over module lattices. Specifically, we make a comprehensive trade-off among multiple significant performance indicators such as the post-quantum security, the failure rate, the communication cost and the running time to guide optimal parameter choices. This rigorous instantiation has never been seen in previous PAKE papers. Additionally, utilizing the flexibility of module lattices, we provide three parameter sets (#1, #2, and #3) matching different security scenarios. We implement and benchmark QSPAK and QSPPK against other competitive proposals. The performance results indicate that our QSPAK and QSPPK, besides being more efficient, exhibit the flexibility and security advantages over the latter schemes. Furthermore, we construct a post-quantum password-authenticated TLS 1.3 framework, aimed towards provide a further suggestion for IETF standardization of quantum-safe PAKE.