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

Quantum Information Processing

Pioneering quantum authenticated key agreement through Grover’s algorithm

Tzung‐Her Chen, Chien-Ding Lee, Yu-Chieh Chang

Published Sep 30, 2025• 1 citation
Publisher
DOI
10.1007/s11128-025-04942-z

Related papers

Controlled and Authenticated Quantum Dialogue Protocol Based on Grover’s Algorithm

Zijian Ai, Aihan Yin

International Journal of Theoretical Physics•Nov 22, 2022•12 citations

A Grover Search-Based Quantum Key Agreement Protocol for Secure Internet of Medical Things Communication

Tzung‐Her Chen

The rapid integration of the Internet of Medical Things (IoMT) into healthcare systems raises urgent demands for secure communication mechanisms capable of protecting sensitive patient data. Quantum key agreement (QKA), a collaborative approach to key generation based on quantum principles, provides an attractive alternative to traditional quantum key distribution (QKD), as it eliminates dependence on a trusted authority and ensures equal participation from all users. QKA demonstrates particular suitability for IoMT’s decentralized medical networks by eliminating trusted authority dependence while ensuring equitable participation among all participants. This addresses fundamental challenges where centralized trust models introduce vulnerabilities and asymmetric access patterns that compromise egalitarian principles essential for medical data sharing. However, practical QKA applications in IoMT remain limited, particularly for schemes that avoid complex entanglement operations and authenticated classical channels. Among the few QKA protocols employing Grover’s search algorithm (GSA), existing proposals potentially suffer from limitations in fairness and security. In this paper, the author proposes an improved GSA-based QKA protocol that ensures fairness, security, and correctness without requiring an authenticated classical communication channel. The proposed scheme guarantees that each participant’s input equally contributes to the final key, preventing manipulation by any user subgroup. The scheme combines Grover’s algorithm with the decoy photon technique to ensure secure quantum transmission. Security analysis confirms resistance to external attacks, including intercept-resend, entanglement probes, and device-level exploits, as well as insider threats such as parameter manipulation. Fairness is achieved through a symmetric protocol design rooted in quantum mechanical principles. Efficiency evaluation shows a theoretical efficiency of approximately 25%, while eliminating the need for quantum memory. These results position the proposed protocol as a practical and scalable solution for future secure quantum communication systems, particularly within distributed IoMT environments.

Future Internet•Jun 17, 2025•1 citation

An Overview of Quantum Key Agreement Protocols

Youssouf Achouri, Rima Djellab, Khaled Hamouid

Information systems engineering and management•Jan 1, 2024•0 citations

Quantum Key Agreement Protocol Based on Quantum Search Algorithm

Xi Huang, Shibin Zhang, Yan Zuo Chang +3 more

International Journal of Theoretical Physics•Jan 19, 2021•50 citations

Multiparty quantum key agreement based on Grover’s algorithm and its implementation

Aihan Yin, Zhifei Han

Multiparty quantum key agreement (MQKA) is a significant topic that the shared key must be negotiated equally by all participants. In this paper, we use Bell state as quantum resource and add controlled-not gate to avoid information leakage. There is very little research on the quantum key agreement protocol based on quantum search algorithms. Therefore, we propose a quantum key agreement protocol which is based on Grover’s algorithm as one of the most famous quantum search algorithms. The security analysis appears very promising.

Modern Physics Letters A•Oct 24, 2018•2 citations

Insider Impersonation Attack on a Tripartite ID-Based Authenticated Key Agreement Protocol with Bilinear Pairings

Meng-Hui Lim, Sang-Gon Lee, Hoon Jae Lee

A key agreement protocol is designed for two or more entities to agree upon a shared secret key, which can subsequently be used to preserve confidentiality and data integrity over an open network. Since Joux has pioneered the notion of pairing-based tripartite key agreement protocol, various group key agreement schemes have been proposed after then. In 2003, Liu et al. proposed a tripartite identity-based authenticated key agreement protocol using bilinear pairings. Although the scheme is claimed to be efficient and secure, we discover that it is in fact breakable. In this paper, we highlight the flaw by demonstrating an insider impersonation attack on the scheme and suggest a few enhancements to conquer the defect.

International Conference on Next Generation Web Services Practices•Oct 1, 2008•1 citation
The rapid integration of the Internet of Medical Things (IoMT) into healthcare systems raises urgent demands for secure communication mechanisms capable of protecting sensitive patient data. Quantum key agreement (QKA), a collaborative approach to key generation based on quantum principles, provides an attractive alternative to traditional quantum key distribution (QKD), as it eliminates dependence on a trusted authority and ensures equal participation from all users. QKA demonstrates particular suitability for IoMT’s decentralized medical networks by eliminating trusted authority dependence while ensuring equitable participation among all participants. This addresses fundamental challenges where centralized trust models introduce vulnerabilities and asymmetric access patterns that compromise egalitarian principles essential for medical data sharing. However, practical QKA applications in IoMT remain limited, particularly for schemes that avoid complex entanglement operations and authenticated classical channels. Among the few QKA protocols employing Grover’s search algorithm (GSA), existing proposals potentially suffer from limitations in fairness and security. In this paper, the author proposes an improved GSA-based QKA protocol that ensures fairness, security, and correctness without requiring an authenticated classical communication channel. The proposed scheme guarantees that each participant’s input equally contributes to the final key, preventing manipulation by any user subgroup. The scheme combines Grover’s algorithm with the decoy photon technique to ensure secure quantum transmission. Security analysis confirms resistance to external attacks, including intercept-resend, entanglement probes, and device-level exploits, as well as insider threats such as parameter manipulation. Fairness is achieved through a symmetric protocol design rooted in quantum mechanical principles. Efficiency evaluation shows a theoretical efficiency of approximately 25%, while eliminating the need for quantum memory. These results position the proposed protocol as a practical and scalable solution for future secure quantum communication systems, particularly within distributed IoMT environments.
Multiparty quantum key agreement (MQKA) is a significant topic that the shared key must be negotiated equally by all participants. In this paper, we use Bell state as quantum resource and add controlled-not gate to avoid information leakage. There is very little research on the quantum key agreement protocol based on quantum search algorithms. Therefore, we propose a quantum key agreement protocol which is based on Grover’s algorithm as one of the most famous quantum search algorithms. The security analysis appears very promising.
A key agreement protocol is designed for two or more entities to agree upon a shared secret key, which can subsequently be used to preserve confidentiality and data integrity over an open network. Since Joux has pioneered the notion of pairing-based tripartite key agreement protocol, various group key agreement schemes have been proposed after then. In 2003, Liu et al. proposed a tripartite identity-based authenticated key agreement protocol using bilinear pairings. Although the scheme is claimed to be efficient and secure, we discover that it is in fact breakable. In this paper, we highlight the flaw by demonstrating an insider impersonation attack on the scheme and suggest a few enhancements to conquer the defect.