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

Journal of Computer Research and Development

RAKA: New Authenticated Key Agreement Protocol Based on Ring-LWE

Yatao Yang, Zhang Yaze, Zichen Li, Zhang Fengjuan, Boya Liu

Published Oct 1, 2017• 2 citations
Publisher
DOI
10.7544/issn1000-1239.2017.20170477

Related papers

A two rounds dynamic authenticated group key agreement protocol based on LWE

Ziqing Wang, Zeyu Yang, Fagen Li

Journal of Systems Architecture•Oct 17, 2022•9 citations

An Identity-Based Authenticated Key Exchange Protocol from RLWE

Xiufeng Zhao, Haiying Gao, Ailan Wang

Journal of Computer Research and Development•Nov 1, 2016•0 citations

Further Analysis of "Lattice-based key agreement protocol under ring-LWE problem for IoT-enabled smart devices"

Mohammad Reza Saeidi, Hamid Mala

Abstract The increasing interconnectedness of devices via the Internet of Things (IoT) highlights the growing importance of addressing IoT security issues. Authenticated Key Agreement (AKA) protocols ensure secure communication between IoT devices, users, and central servers. Preserving anonymity in AKA protocols is especially crucial given privacy issues and user preferences. The emergence of Shor's algorithm in 1994 and recent advancements in quantum computing have posed a threat to the security of classical AKA schemes relying on integer factorization, discrete logarithm, and other number theory problems. Consequently, researchers have turned their attention to developing quantum-resistant AKA schemes. In this context, Rana and Mishra introduced a lattice-based key agreement protocol under ring-LWE problem for IoT-enabled smart devices. However, a thorough security assessment uncovered vulnerabilities in their protocol, specifically susceptibility to replay and Key Compromise Impersonation (KCI) attacks. Furthermore, their approach reveals potential weaknesses in user impersonation if the user's identity is compromised.

•Sep 27, 2024•2 citations

Authenticated Key Agreement Protocol

Massoud, Hadian, Dehkordi +2 more

China Communications•Jan 1, 2010•2 citations

Anonymous Three-Party Quantum-Safe Authenticated Key Agreement with Forward Secrecy: Ring Learning with Errors

Swati Thakur, Hemlal Sahu, Pratik Gupta

Objective: To design a secure and efficient three-party post-quantum authenticated key agreement (AKE) protocol that ensures mutual authentication, user anonymity, and forward secrecy, while resisting both classical and quantum adversaries. Methods: The proposed protocol is constructed using the Ring Learning with Errors (Ring-LWE) assumption, which is widely regarded as quantum-resistant. The scheme enables two users to establish a shared session key through a trusted server over an insecure channel. Cryptographic hash functions, lattice-based operations, and masking techniques are employed to achieve authentication, anonymity, and key confidentiality. Formal correctness proofs, informal security analysis, and comparative performance evaluations are conducted to validate the protocol. Findings: The study describes qualitative benefits like "outperforms current protocols" but lacks specific metrics, such as exact computation costs (e.g., 4913 ns total execution) or communication rounds, and "reduces user-side cost to 2438 ns vs. 5395 ns in Islam et al.". Also, substantially more efficient than pairing- or chaotic-map-based protocols, which incur costs exceeding 12000 ns. Communication overhead is reduced by limiting the exchange to two RLWE-based messages and one server response, avoiding expensive bilinear pairing or biometric hash transmissions. These results demonstrate that the proposed scheme provides stronger security guarantees at a lower computational and communication cost, making it suitable for resource-constrained mobile and IoT environments. Novelty: Unlike existing approaches, the proposed protocol simultaneously guarantees user anonymity, forward secrecy, and quantum resistance in a three-party setting based on Ring-LWE. It overcomes known vulnerabilities in prior schemes and achieves improved efficiency without compromising security, making it a practical and robust solution for post-quantum secure communications. Keywords: Key Establishment, Authentication, Ring Learning with Errors, Anonymous Key Exchange, Post Quantum Forward Secrecy

Indian Journal of Science and Technology•Feb 26, 2026•0 citations

Big Data Analytics-Envisioned Quantum-Safe Lattice-Based Three-Party Authenticated Key Agreement Protocol for Cloud IoT-Enabled Healthcare Applications

Prithwi Bagchi, Aakash Roy, Mohammad Wazid +3 more

Cloud-based Internet of Things (IoT)-enabled smart healthcare plays a vital role in modern society, yet security and privacy challenges remain unavoidable. The authenticated key agreement (AKA) process, which serves as the foundation of secure communication, is widely recognized as a key solution to these challenges. However, many existing AKA methods in the literature either involve high communication and computational costs or fail to withstand quantum attacks. Post-quantum cryptography (PQC) introduces a new class of cryptographic algorithms designed to resist future quantum computer threats. In this article, we present a quantum-secure, lattice-based three-party AKA scheme for smart IoT healthcare applications, leveraging the computationally complex Ring-Learning With Errors (Ring-LWE) problem. Our approach integrates secure big-data analytics with blockchain technology by utilizing authentication procedures for secure data aggregation before storing it in the blockchain. A comprehensive security evaluation including formal and informal analysis, demonstrates the scheme's strong resilience against both classical and quantum attacks. Additionally, experimental results confirm that the proposed scheme is well-suited for real-time smart healthcare applications.

IEEE Transactions on Dependable and Secure Computing•Sep 3, 2025•7 citations
Abstract The increasing interconnectedness of devices via the Internet of Things (IoT) highlights the growing importance of addressing IoT security issues. Authenticated Key Agreement (AKA) protocols ensure secure communication between IoT devices, users, and central servers. Preserving anonymity in AKA protocols is especially crucial given privacy issues and user preferences. The emergence of Shor's algorithm in 1994 and recent advancements in quantum computing have posed a threat to the security of classical AKA schemes relying on integer factorization, discrete logarithm, and other number theory problems. Consequently, researchers have turned their attention to developing quantum-resistant AKA schemes. In this context, Rana and Mishra introduced a lattice-based key agreement protocol under ring-LWE problem for IoT-enabled smart devices. However, a thorough security assessment uncovered vulnerabilities in their protocol, specifically susceptibility to replay and Key Compromise Impersonation (KCI) attacks. Furthermore, their approach reveals potential weaknesses in user impersonation if the user's identity is compromised.
Objective: To design a secure and efficient three-party post-quantum authenticated key agreement (AKE) protocol that ensures mutual authentication, user anonymity, and forward secrecy, while resisting both classical and quantum adversaries. Methods: The proposed protocol is constructed using the Ring Learning with Errors (Ring-LWE) assumption, which is widely regarded as quantum-resistant. The scheme enables two users to establish a shared session key through a trusted server over an insecure channel. Cryptographic hash functions, lattice-based operations, and masking techniques are employed to achieve authentication, anonymity, and key confidentiality. Formal correctness proofs, informal security analysis, and comparative performance evaluations are conducted to validate the protocol. Findings: The study describes qualitative benefits like "outperforms current protocols" but lacks specific metrics, such as exact computation costs (e.g., 4913 ns total execution) or communication rounds, and "reduces user-side cost to 2438 ns vs. 5395 ns in Islam et al.". Also, substantially more efficient than pairing- or chaotic-map-based protocols, which incur costs exceeding 12000 ns. Communication overhead is reduced by limiting the exchange to two RLWE-based messages and one server response, avoiding expensive bilinear pairing or biometric hash transmissions. These results demonstrate that the proposed scheme provides stronger security guarantees at a lower computational and communication cost, making it suitable for resource-constrained mobile and IoT environments. Novelty: Unlike existing approaches, the proposed protocol simultaneously guarantees user anonymity, forward secrecy, and quantum resistance in a three-party setting based on Ring-LWE. It overcomes known vulnerabilities in prior schemes and achieves improved efficiency without compromising security, making it a practical and robust solution for post-quantum secure communications. Keywords: Key Establishment, Authentication, Ring Learning with Errors, Anonymous Key Exchange, Post Quantum Forward Secrecy
Cloud-based Internet of Things (IoT)-enabled smart healthcare plays a vital role in modern society, yet security and privacy challenges remain unavoidable. The authenticated key agreement (AKA) process, which serves as the foundation of secure communication, is widely recognized as a key solution to these challenges. However, many existing AKA methods in the literature either involve high communication and computational costs or fail to withstand quantum attacks. Post-quantum cryptography (PQC) introduces a new class of cryptographic algorithms designed to resist future quantum computer threats. In this article, we present a quantum-secure, lattice-based three-party AKA scheme for smart IoT healthcare applications, leveraging the computationally complex Ring-Learning With Errors (Ring-LWE) problem. Our approach integrates secure big-data analytics with blockchain technology by utilizing authentication procedures for secure data aggregation before storing it in the blockchain. A comprehensive security evaluation including formal and informal analysis, demonstrates the scheme's strong resilience against both classical and quantum attacks. Additionally, experimental results confirm that the proposed scheme is well-suited for real-time smart healthcare applications.