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 Journal of Information Security

Comparing apples with apples: performance analysis of lattice-based authenticated key exchange protocols

Nina Bindel, Johannes A Buchmann, Susanne Rieß

Published Dec 9, 2017• 3 citations
Publisher
DOI
10.1007/s10207-017-0397-6

Related papers

An Analysis of Lattice-Based Key Exchange Protocols

Susanne Rieß

•Feb 1, 2016•0 citations

Post-Quantum Lattice-Based Secure Reconciliation Enabled Key Agreement Protocol for IoT

Dharminder Dharminder, Challa Bhageeratha Reddy, Ashok Kumar Das +2 more

The authenticated key agreement is one of the major security services that can be used to secure an Internet of Things (IoT) environment, where the devices collect the data and the data is then aggregated at the cloud server, and then a user needs to access the data stored at the server(s) securely. For this purpose, after a mutual authentication performed between a user and the accessed server, a session key needs to be established among them for secure communication. In this article, we design an efficient lattice-based authenticated key exchange protocol using ring-based version of learning with errors assumption for the IoT-enabled smart devices. The proposed protocol is basically a key exchange that uses the reconciliation mechanism. The detailed security analysis under the standard model has been performed along with the informal security analysis to show that the proposed protocol is robust against different attacks. We then simulate the proposed protocol under the NS-3 simulator to measure the network performance parameters like network throughput and latency. A comparative analysis shows that the proposed protocol has superior security, less computational cost, and comparable communication cost when compered these parameters with the other competing schemes.

IEEE Internet of Things Journal•Oct 12, 2022•61 citations

Anonymous Password-Authenticated Key Exchange Protocol Based on Lattice

Yun Song, Songhui Guo, Ruiyang Ding

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.

International Conference on Big Data, Information and Computer Network (BDICN)•Jan 1, 2023•5 citations

Efficient KEA-Style Lattice-Based Authenticated Key Exchange

Zilong Wang, Honggang Hu

Communications in computer and information science•Jan 1, 2018•3 citations

Design and Implementation of a Post-Quantum Group Authenticated Key Exchange Protocol With the LibOQS Library: A Comparative Performance Analysis From Classic McEliece, Kyber, NTRU, and Saber

José Ignacio Escribano Pablos, Misael Enrique Marriaga, Ángel Luis Pérez del Pozo

Group authenticated key exchange protocols (GAKE) are cryptographic tools enabling a group of several users communicating through an insecure channel to securely establish a common shared high-entropy key. In the last years, the need to design cryptographic tools which provide security in the presence of attackers with access to quantum resources has become unquestionable; the field dealing with these types of protocols is usually referred to as Post-Quantum Cryptography. The U.S. National Institute for Standards and Technology (NIST) launched in 2017 an open call to find suitable post-quantum public-key algorithms for standardization. In this work, we design a GAKE that can be instantiated with any key encapsulation mechanism (KEM) that satisfies the strong security notion IND-CCA, matching NIST’s requirements for this primitive. We have implemented our GAKE with the four finalist KEMs from the NIST process: Classic McEliece, Kyber, NTRU, and Saber, making use of the open-source library LibOQS where these algorithms are provided. We have conducted a detailed comparative performance analysis of the resulting GAKE protocols, taking into account all the parameter sets proposed in the submissions. We have also made a performance analysis of all the involved building pieces, including the four finalist KEMs. Finally, we also compare our GAKE with a previous proposal implemented with Kyber.

IEEE Access•Jan 1, 2022•14 citations

Analysis and Improvement of an Authenticated Key Exchange Protocol

Jiaxin Pan, Libin Wang, Changshe Ma

Lecture notes in computer science•Jan 1, 2011•3 citations
The authenticated key agreement is one of the major security services that can be used to secure an Internet of Things (IoT) environment, where the devices collect the data and the data is then aggregated at the cloud server, and then a user needs to access the data stored at the server(s) securely. For this purpose, after a mutual authentication performed between a user and the accessed server, a session key needs to be established among them for secure communication. In this article, we design an efficient lattice-based authenticated key exchange protocol using ring-based version of learning with errors assumption for the IoT-enabled smart devices. The proposed protocol is basically a key exchange that uses the reconciliation mechanism. The detailed security analysis under the standard model has been performed along with the informal security analysis to show that the proposed protocol is robust against different attacks. We then simulate the proposed protocol under the NS-3 simulator to measure the network performance parameters like network throughput and latency. A comparative analysis shows that the proposed protocol has superior security, less computational cost, and comparable communication cost when compered these parameters with the other competing schemes.
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.
Group authenticated key exchange protocols (GAKE) are cryptographic tools enabling a group of several users communicating through an insecure channel to securely establish a common shared high-entropy key. In the last years, the need to design cryptographic tools which provide security in the presence of attackers with access to quantum resources has become unquestionable; the field dealing with these types of protocols is usually referred to as Post-Quantum Cryptography. The U.S. National Institute for Standards and Technology (NIST) launched in 2017 an open call to find suitable post-quantum public-key algorithms for standardization. In this work, we design a GAKE that can be instantiated with any key encapsulation mechanism (KEM) that satisfies the strong security notion IND-CCA, matching NIST’s requirements for this primitive. We have implemented our GAKE with the four finalist KEMs from the NIST process: Classic McEliece, Kyber, NTRU, and Saber, making use of the open-source library LibOQS where these algorithms are provided. We have conducted a detailed comparative performance analysis of the resulting GAKE protocols, taking into account all the parameter sets proposed in the submissions. We have also made a performance analysis of all the involved building pieces, including the four finalist KEMs. Finally, we also compare our GAKE with a previous proposal implemented with Kyber.