[Retracted] Cryptanalysis and Improvements on Quantum Key Agreement Protocol Based on Quantum Search Algorithm

Abulkasim, Hussein; Alabdulkreem, Eatedal; Karim, Faten; Ahmed, Nada; Jamjoom, Mona; Hadjouni, Myriam; Abbas, Safia

doi:https://doi.org/10.1155/2022/3803621

Security and Communication Networks

On this page

Abstract Introduction Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article Retraction

!

This article has been Retracted. To view the article details, please click the ‘Retraction’ tab above.

Special Issue

Security Hardened and Privacy Preserved Vehicle-to-Everything (V2X) Communication 2021

View this Special Issue

Research Article | Open Access

Volume 2022 | Article ID 3803621 | https://doi.org/10.1155/2022/3803621

[Retracted] Cryptanalysis and Improvements on Quantum Key Agreement Protocol Based on Quantum Search Algorithm

Hussein Abulkasim,¹Eatedal Alabdulkreem,²Faten Karim,²Nada Ahmed,²Mona Jamjoom,²Myriam Hadjouni,²and Safia Abbas²

Academic Editor: Irshad Azeem

Received27 Jan 2022

Revised09 Feb 2022

Accepted24 Feb 2022

Published17 Mar 2022

Abstract

Recently, Huang et al. (2021) presented a quantum key agreement schemeto securely negotiate on a secret key employing the properties of a quantumsearch algorithm. First, the authors proposed the two-party quantum key agreement, and then they extended their work to the three-party case. Huang et al.‘s protocol employs the unitary operation and single-particle measurements to negotiate on a secret key without using complex quantum technologies such as quantum memory or entangled quantum particles. The authors claimed that their protocol is secure and efficient. However, this work shows that Huang et al.‘s protocol has a significant pitfall, where the private key of one user could be easily leaked to the attackers. Hence, the properties of security and fairness are not achieved. Accordingly, thetwo-party and three-party of Huang et al.’s protocol have been reviewed, and an improvementto address the shortcoming is suggested.

1. Introduction

Key agreement is a security protocol that aims to generate and exchange secure key encryption among two or more distant users. Due to its greatest significance, key agreement protocols have been employed to generate encryption keys in today’s IT applications such as IoT applications [1], healthcare systems [2], vehicular communications [3], smart networks [4], satellite communications [5], cloud applications [6], and others. To resist quantum attacks, several security protocols have been proposed based on the principles of quantum physics for addressing various security problems [7–26]. The pioneering quantum-based key agreement (QKA) protocol was proposed in 2004 [27]. Subsequently, several QKA protocols have been introduced [11, 12, 16, 22]. Generally, there are different types of quantum key agreement protocols in terms of QKA’s structure and efficiency [28]: (1) the tree-QKA protocols, in which each user sends their private data to all other users via a quantum channel; (2) the complete-graph-QKA protocol, in which each user sends his encoded private data as a sequence of particles to each user participated in the protocol; and (3) the circle-QKA protocol, which is the most adopted type, in which each user pra sequence of particles representing his private key and sends it to the next user in a circle to encode his private data until it is returned to the sender (the first user). The circle-QKA protocol is more efficient than the other QKA types and is better at achieving the characteristic of fairness. In contrast, the complete-graph-QKA is more secure than the other QKA types. Thus, designing a secure and efficient QKA protocol has become a challenging task and got more and more attention.

Recently, Huang et al. [29] presented a new QKA scheme based on Grover’s algorithm []. Theirprotocol enables authorized users to negotiate on a shared secure key, and noneof the authorized users can fully get the final agreement key alone. Grover’s search algorithm is used for accelerating the search process for the marked items. Their proposed protocol is feasible and does not use quantum memory or complex quantum devices. However, the Huang-QKA protocol cannot maintain the property of fairness since the level of security of the key agreement of users is not equal. A quick review of the Huang-QKA scheme is shown in Section 2. The security analysis of the Huang-QKA protocol and the suggested improvementsare presented in Section 3 and Section 4, respectively. The security analysis based on the modified steps is presented in Section 5. Section 6 concludes this work.

2. Review of Huang-QKA Protocol

Huang-QKA protocol employed the Grover quantum search algorithm (QSA) [30] to agree on a two-user QKA protocol. Basically, the Grover QSA is one of the most significant quantum computing algorithms which can be used to search for marked items in an unsorted database faster than all known classical search algorithms. For more clarification, assume that we we are searching for a target ω in a two-qubit Grover QSA, and the targeted database is a two-qubit quantum system . Two unitary operations can be used to evolve the quantum system . The measurement can be used to measure . Wecan describe the two unitary operations as follows:where is identity operation, , and the quantum system .

can be defined as follows:

Two common properties of Grover QSA van be stated as follows.

Property 1 (see [31]). For , let . If we have , then we can say that .

Property 2 (see [32]). Assume that we have , and . Then, we can say that .

2.1. The Two-Party Huang-QKA Protocol

Assume that there are two remoteusers (e.g., Alice and Bob) who want to negotiate on an agreement key . Aliceand Bob agree on generating two random bit classical secret keys and , respectively.where and .

By combining the idea of two-qubit Grover’s QSA with the QKA protocol, Huang-QKA protocol has been proposed. The steps of Huang-QKA protocol can be described as follows (see also Figure 1).(1)Alice generates an ordered sequence of the two-qubit quantum state according to her private information , that is, if Alice’s two classical bits are 00, 01, 10, or 11, Alice generates the quantum state , , , or , respectively. Alice also employs the decoy qubit protocol to protect the quantum channel by preparing a sequence of decoy qubit states randomly selected from the group states The selected decoy qubits are inserted randomly into obtaining new sequence and Alice records their positions. Subsequently, Alice sends the evolved sequence to Bob through a quantum channel.(2)Upon getting the evolved sequence , Bob publicly announces his secret key through an authenticated classical channel.(3)After receiving the secret key of Bob , Alice computes the expression to get the final agreement key .(4)Alice publicly announces the positions of the decoy qubits in and their measurement bases to Bob. Alice and Bob start evaluating the error rate ofmeasurement. If the computed error rate exceeds a preset threshold, the users should stop the protocol and restart from the first step. Otherwise, they proceed to the last step.(5)Bob discards the measured decoy qubits and gets the ordered sequence . Based on his private key , Bob applies the two unitary operations and to getting a new quantum sequence . Bob measures the new sequence using . The measurement result that Bob gets is the final agreement key .

(a)

(b)

(c)

2.2. The Three-Party Huang-QKA Protocol

Assume that there are three remote users (e.g.,Alice, Bob, Charlie) who want to negotiate on an agreement key . Alice, Bob, and Charlie agree on generating three random bit classical secret keys , , and , respectively.where and .

The steps of the three-party Huang-QKA protocol are as follows:(1)Alice generates an ordered sequence of the two-qubit quantum state according to her private information , that is, if Alice’s two classical bits are 00, 01, 10, or 11, Alice generates the quantum state , , , or , respectively. Alice also employs the decoy qubit protocol to protect the quantum channel by preparing a sequence of decoy qubit states randomly selected from the group states . The selected decoy qubits are inserted randomly into and obtaining new sequences and . Subsequently, Alice sends the evolved sequences and to Bob and Charlie, respectively, through two quantum channels.(2)Upon getting the evolved sequences , Bob (Charlie) publicly announces his secret key through an authenticated classical channel.(3)After receiving the secret key of Bob (Charlie), Alice computes the expression to get the final agreement key .(4)Alice publicly reveals positions of the decoy qubits in and their measurement bases to Bob (Charlie). Alice and Bob (Charlie) start evaluating the error rate ofmeasurement. If the computed error rate exceeds a preset threshold, the users should stop the protocol and restart from the first step. Otherwise, they proceed to the last step.(5)Bob (Charlie) discards the measured decoy qubits and gets the ordered sequence . Based on his private key , Bob (Charlie) applies the two unitary operations and to getting a new quantum sequence Bob measures the new sequence using . The measurement result that Bob (Charlie) gets is the final agreement key .

3. The Security Analysis of Huang-QKA Protocol

The quantum key agreement aims to agree on a secret key among two or more users fairly. There are three properties that should be guaranteed while designing a QKA protocol as follows.

Security. External eavesdroppers cannot obtain the final key or any useful information about it without being caught.

Correctness. Each legal user is guaranteed that the key agreement that it gets is correct.

Fairness. All involved users influence the final agreement key equally. One user receives her/his agreement key if and only if the other user receives their agreement key with the same level of security, power, and feasibility.

In the Huang-QKA protocol, there are two proposed protocols, the two-party QKA protocol and the extended three-party QKA protocol. Since the two proposed protocols are similar, we only here discuss the security of the two-party case of Huang-QKA protocol. In step (1), only Alice prepares a quantum sequence based on her private key through a quantum channel. In step (2), Bob sends his private key though an authenticated classical channel. While in step (3), Alice can get the agreement key by computing . If the used classical channel in step (2) is secure enough to share the private key of Bob, why do we not use a similar channel to share the private key of Alice? Of course, there is no need to employ quantum technology to achieve the key agreement if we do this. Also, this is against the aim of the Huang-QKA protocol. Obviously, there are shortcomings in the design of the Huang-QKA protocol, as eavesdroppers can clone the key transmitted over the classic channel if they have sufficient computing power or a quantum computer. Even if this shortcoming does not affect the security of the agreement key, at least it can lead to the leakage of Bob’s private key. The attackers can easily clone the private key of Bob . Therefore, the Huang-QKA protocol cannot maintain the property of fairness based on the suggested strategy.

4. Improvement on Huang-QKA Protocol

To address the shortcoming of the Huang-QKA protocol, three steps of the Huang-QKA protocol should be modified and the remaining steps will remain unchanged as follows:(1)Alice (Bob) generates an ordered sequence of the two-qubit quantum state according to her private information , that is, if Alice’s (Bob’s) two classical bits are 00, 01, 10, or 11, Alice (Bob) generates the quantum state , , , or , respectively. Alice (Bob) also employs the decoy qubit protocol to protect the quantum channel by preparing a sequence of decoy qubit states selected from the group states { randomly. The selected decoy qubits are inserted into obtaining new sequence and Alice (Bob) records their positions. Subsequently, Alice (Bob) sends the evolved sequence to Bob (Alice) through a quantum channel.(2)Upon getting the evolved sequence , Bob (Alice) publicly reveals positions of the decoy qubits in and their measurement bases to Bob (Alice). Alice and Bob start evaluating the error rate ofmeasurement. If the computed error rate exceeds a preset threshold, the users should stop the protocol and restart from the first step. Otherwise, they proceed to the last step.(3)Bob (Alice) discards the measured decoy qubits and gets the ordered sequence . Based on his private key , Bob (Alice) applies the two unitary operations and to ( and to ) getting a new quantum sequence (). Bob (Alice) measures the new sequence using . The measurement result that Bob (Alice) gets is the final key ().

5. Security Analysis

In addition to the security analysis shown in the original protocol [29], this section shows how the modified steps overcome the security flaw in the Huang-QKA protocol (see Figure 1). In step (1) of the modified protocol, Alice and Bob send their private information ( ()) through a quantum channel. Alice (Bob) uses the decoy photon protocol to check transmission security. If an eavesdropper tries to get useful information from the quantum channel, she/he must stop the traveled sequence and measure it; then, she/he must resend it to the receiver. The probability of selecting correct measurement bases is 50%, and the probability of choosing correct initial bases to regenerate the traveled photons is 50%. So, the probability of passing the security check is . The probability of detecting the malicious behavior of the eavesdropper is close to one () when the decoy sequence () is large enough. Thus, the modified protocol is secure against eavesdroppers and achieves the principle of fairness.

6. Conclusion

This work studies the security of the Huang-QKA schemeto securely negotiate on a secret key employing the properties of a quantumsearch algorithm. Their work uses the technique of decoy photons to secure thetransmission against external eavesdroppers. Besides, Grover’s search algorithm is used for accelerating the search process for the marked items in an unsorted database. This work found that the Huang-QKA protocol cannot maintain the properties of security and fairness since the level of security of the key agreement of users is not equal. Finally, we suggested an improved version of the Huang-QKA protocol that achieves the properties of fairness and security.

Data Availability

All data generated or analyzed during this study are included within the article.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This study was supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2022R104), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

References

T.-Y. Wu, T. Wang, Y.-Q. Lee, W. Zheng, S. Kumari, and S. Kumar, “Improved authenticated key agreement scheme for fog-driven IoT healthcare system,” Security and Communication Networks, vol. 2021, Article ID 6658041, 16 pages, 2021.
View at: Publisher Site | Google Scholar
Y. Chen and J. Chen, “A secure three-factor-based authentication with key agreement protocol for e-Health clouds,” The Journal of Supercomputing, vol. 77, no. 4, pp. 3359–3380, 2021.
View at: Publisher Site | Google Scholar
S. A. Eftekhari, M. Nikooghadam, and M. Rafighi, “Security-enhanced three-party pairwise secret key agreement protocol for fog-based vehicular ad-hoc communications,” Vehicular Communications, vol. 28, Article ID 100306, 2021.
View at: Publisher Site | Google Scholar
L. Deng and R. Gao, “Certificateless two-party authenticated key agreement scheme for smart grid,” Information Sciences, vol. 543, pp. 143–156, 2021.
View at: Publisher Site | Google Scholar
I. Altaf, M. Arslan Akram, K. Mahmood, S. Kumari, H. Xiong, and M. Khurram Khan, “A novel authentication and key‐agreement scheme for satellite communication network,” Transactions on Emerging Telecommunications Technologies, vol. 32, Article ID e3894, 2021.
View at: Publisher Site | Google Scholar
I. Hayat, S. Chaudhry, and A. Irshad, “A symmetric cryptography based key agreement protocol for distributed cloud computing environment,” Researchpedia Journal of Computing, vol. 2, pp. 117–126, 2021.
View at: Google Scholar
A. Yin and T. Chen, “Authenticated semi-quantum secret sharing based on GHZ-type states,” International Journal of Theoretical Physics, vol. 60, pp. 265–273, 2021.
View at: Publisher Site | Google Scholar
G. Gao, Y. Wang, D. Wang, and L. Ye, “Comment on ‘authenticated quantum secret sharing with quantum dialogue based on bell states’,” Physica Scripta, vol. 93, no. 2, Article ID 027002, 2018.
View at: Publisher Site | Google Scholar
Z. Liu and H. Chen, “Analyzing and improving the secure quantum dialogue protocol based on four-qubit cluster state,” International Journal of Theoretical Physics, vol. 59, pp. 2120–2126, 2020.
View at: Publisher Site | Google Scholar
P. Zawadzki, “Quantum identity authentication without entanglement,” Quantum Information Processing, vol. 18, no. 1, pp. 1–12, 2019.
View at: Publisher Site | Google Scholar
L. Wang and W. Ma, “Quantum key agreement protocols with single photon in both polarization and spatial-mode degrees of freedom,” Quantum Information Processing, vol. 16, no. 5, p. 130, 2017.
View at: Publisher Site | Google Scholar
V. S. Naresh, M. M. Nasralla, S. Reddi, and I. García-Magariño, “Quantum d-hellman extended to dynamic quantum group key agreement for e-healthcare multi-agent systems in smart cities,” Sensors, vol. 20, no. 14, p. 14, 2020.
View at: Publisher Site | Google Scholar
R. G. Zhou and Y. Huo, “Dynamic multiparty quantum secret sharing with a trusted party based on generalized GHZ state,” Ieee Access, vol. 9, pp. 22986–22995, 2021.
View at: Google Scholar
P. H. Lin, T. Hwang, and C. W. Tsai, “Efficient semi-quantum private comparison using single photons,” Quantum Information Processing, vol. 18, pp. 1–14, 2019.
View at: Publisher Site | Google Scholar
S.-S. Wang, G.-B. Xu, X.-Q. Liang, and Y.-L. Wu, “Multiparty quantum key agreement with four-qubit symmetric W state,” International Journal of Theoretical Physics, vol. 57, no. 12, pp. 3716–3726, 2018.
View at: Publisher Site | Google Scholar
H. Abulkasim and A. Alotaibi, “Improvement on ‘multiparty quantum key agreement with four-qubit symmetric W state',” International Journal of Theoretical Physics, vol. 58, no. 12, pp. 4235–4240, 2019.
View at: Publisher Site | Google Scholar
A. A. A. El-Latif, B. Abd-El-Atty, M. S. Hossain, S. Elmougy, and A. Ghoneim, “Secure quantum steganography protocol for fog cloud internet of things,” IEEE access, vol. 6, pp. 10332–10340, 2018.
View at: Publisher Site | Google Scholar
G.-l. Long, F.-g. Deng, C. Wang, X.-h. Li, K. Wen, and W.-y. Wang, “Quantum secure direct communication and deterministic secure quantum communication,” Frontiers of Physics in China, vol. 2, no. 3, pp. 251–272, 2007.
View at: Publisher Site | Google Scholar
C. Wang, F.-G. Deng, Y.-S. Li, X.-S. Liu, and G. L. Long, “Quantum secure direct communication with high-dimension quantum superdense coding,” Physical Review A, vol. 71, Article ID 044305, 2005.
View at: Publisher Site | Google Scholar
J.-Y. Hu, B. Yu, M.-Y. Jing et al., “Experimental quantum secure direct communication with single photons,” Light: Science & Applications, vol. 5, no. 9, e16144 pages, 2016.
View at: Publisher Site | Google Scholar
A. Elhadad, S. Abbas, H. Abulkasim, and S. Hamad, “Improving the security of multi-party quantum key agreement with five-qubit Brown states,” Computer Communications, vol. 159, pp. 155–160, 2020.
View at: Publisher Site | Google Scholar
H. Abulkasim, A. Mashatan, and S. Ghose, “Secure multiparty quantum key agreement against collusive attacks,” Scientific Reports, vol. 11, pp. 1–8, 2021.
View at: Publisher Site | Google Scholar
X.-Q. Cai, T.-Y. Wang, C.-Y. Wei, and F. Gao, “Cryptanalysis of multiparty quantum digital signatures,” Quantum Information Processing, vol. 18, pp. 1–12, 2019.
View at: Publisher Site | Google Scholar
S. Singh, N. K. Rajput, V. K. Rathi, H. M. Pandey, A. K. Jaiswal, and P. Tiwari, “Securing blockchain transactions using quantum teleportation and quantum digital signature,” Neural Processing Letters, pp. 1–16, 2020.
View at: Publisher Site | Google Scholar
C.-M. Zhang, Y. Zhu, J.-J. Chen, and Q. Wang, “Practical quantum digital signature with configurable decoy states,” Quantum Information Processing, vol. 19, pp. 1–7, 2020.
View at: Publisher Site | Google Scholar
H. Abulkasim, A. Mashatan, and S. Ghose, “Security improvements for privacy-preserving quantum multiparty computation based on circular structure,” Quantum Information Processing, vol. 21, pp. 1–12, 2022.
View at: Publisher Site | Google Scholar
N. Zhou, G. Zeng, and J. Xiong, “Quantum key agreement protocol,” Electronics Letters, vol. 40, no. 18, pp. 1149-1150, 2004.
View at: Publisher Site | Google Scholar
B. Liu, D. Xiao, H.-Y. Jia, and R.-Z. Liu, “Collusive attacks to “circle-type” multi-party quantum key agreement protocols,” Quantum Information Processing, vol. 15, no. 5, pp. 2113–2124, 2016.
View at: Publisher Site | Google Scholar
X. Huang, S.-B. Zhang, Y. Chang, C. Qiu, D.-M. Liu, and M. Hou, “Quantum key agreement protocol based on quantum search algorithm,” International Journal of Theoretical Physics, vol. 60, no. 3, pp. 838–847, 2021.
View at: Publisher Site | Google Scholar
L. K. Grover, “Quantum mechanics helps in searching for a needle in a haystack,” Physical Review Letters, vol. 79, no. 2, pp. 325–328, 1997.
View at: Publisher Site | Google Scholar
H.-Y. Tseng, C.-W. Tsai, and T. Hwang, “Controlled deterministic secure quantum communication based on quantum search algorithm,” International Journal of Theoretical Physics, vol. 51, no. 8, pp. 2447–2454, 2012.
View at: Publisher Site | Google Scholar
C. H. Bennett and G. Brassard, “Quantum cryptography: public key distribution and coin tossing,” 2020, https://arxiv.org/abs/2003.06557.
View at: Google Scholar

Copyright

Copyright © 2022 Hussein Abulkasim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

510

Downloads

487

Citations