Abstract
Recently, Lin et al. proposed a quantum protocol (Quantum Inf Process 13:239, 2014), which can compare the secret data of Alice and Bob without the help from a third party. Here it will be shown that the protocol is insecure. Both Alice and Bob can learn the secret of the other party without being detected.
Similar content being viewed by others
References
Jakobsson, M., Yung, M.: Proving without knowing: on oblivious, agnostic and blindfolded provers. In: Advances in Cryptology: CRYPTO ’96, Lecture Notes in Computer Science, vol. 1109, p. 186. Springer, Berlin (1996)
He, G.P.: Simple quantum protocols for the millionaire problem with a semi-honest third party. Int. J. Quantum Inf. 11, 1350025 (2013)
Lin, J., Yang, C.-W., Hwang, T.: Quantum private comparison of equality protocol without a third party. Quantum Inf. Process. 13, 239 (2014)
Lo, H.-K.: Insecurity of quantum secure computations. Phys. Rev. A 56, 1154 (1997)
Author information
Authors and Affiliations
Corresponding author
Additional information
The author thanks Prof. Bang-Hai Wang for his helping. This work was supported in part by the NSF of China, the NSF of Guangdong province, and the Foundation of Zhongshan University Advanced Research Center.
Rights and permissions
About this article
Cite this article
He, G.P. Comment on “Quantum private comparison of equality protocol without a third party”. Quantum Inf Process 14, 2301–2305 (2015). https://doi.org/10.1007/s11128-015-0963-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-015-0963-7