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 Physics Conference Series

A two-party quantum private comparison of equality protocol with better performance in resisting outside attack

Xiao Feng, Zhe Zhang, Qing Wu, Changgui Huang, Jincheng Li, Ruyi Chen, Xiaoxiao Tang

Published Mar 1, 2019• 0 citations
Publisher

Abstract

Private Comparison (PC) is an extension of Yao's millionaire problem: two millionaires want to know if their wealth is equal, but they don't want to reveal their specific wealth. In classical cryptography, this problem has been well studied. However, the security issues of these protocols are based on computational complexity assumptions, which means they cannot resist powerful quantum computing. In this paper, a quantum private comparison of equality with better performance in resisting outside attack is proposed based on two parties. Compared with the previous protocol, our protocol greatly reduce the total probability of obtaining the wrong result. And it also can compare successfully even if the two hash value string are short and close. Meanwhile, our protocol can be implemented easily without using entanglement, joint measurements and quantum memory and so on. Finally, we show that our protocol can be secure against the attacks from both the outside eavesdroppers and the inside participants.

DOI
10.1088/1742-6596/1176/6/062051

Related papers

An Efficient Secure Generalized Comparison Protocol

Motahareh Dehghan, Babak Sadeghiyan

In this paper, we present a protocol for generalized secure comparison problem. Yao's millionaire problem is for comparing the wealth of two parties by preserving their privacy. If$n$parties want to compare their wealth by using Yao's protocol, it should be run$n(n-1)$2 times; if their wealth interval is as large as N, the complexity of Yao's protocol for$n$parties is in order of N.$\mathbf{n}^{2}, \mathbf{i}.\mathbf{e}$.$\mathbf{O}\ (\mathbf{N}.\mathbf{n}^{2})$. In this paper, we present a generalized secure comparison protocol, which need not to be run by every two parties separately. We use an easy knapsack problem for distinguishing parties' indices. Our protocol computation and communication complexities are bounded by 0 (n).

Iranian Conference on Electrical Engineering•May 1, 2018•5 citations

Quantum Private Comparison Based on GHZ-type States

Xi Huang, Shibin Zhang, Wen Cheng

In this paper, an efficient quantum private comparison (QPC) protocol based on GHZ-type states is proposed. Two participants can compare the equality of two classical bits in each comparison, which could greatly reduce comparison times and increase efficiency. A semi-honest third-party (TP) is involved in assisting the participants to compare their secrets. TP may misbehave on her own, but she is not allowed to conspire with any participants. Besides, the proposed protocol needs Hadamard operation as well as single-particle measurements and Bell measurements, which are easy to implement with current technologies. Finally, the analysis shows the proposed protocol is correct and it can resist various attacks including outside attacks and dishonest participant attacks.

IEEE AFRICON•Sep 13, 2021•7 citations

A new quantum private comparison protocol

Zhiwen Zhao, Ling Xu, Jing Wang +1 more

For two participants to compare the equality of their private information without revealing them, a new quantum private protocol with the help of semi-honest third party TP is proposed. Different from previous protocols, the four particle |Wf⟩ state and the |χ+⟩ state are utilized in this protocol as the carriers of quantum information and form the entanglement swapping as basic principle. The simple measurement of quantum states and exclusive-or operation are only required to conduct in this protocol. What’s more, this protocol can compare two bits of two participants’ private information in every comparison time. Meanwhile, it needs no unitary operation to fulfill this protocol. This protocol is feasible and efficient to execute through these aspects. In the end, the security of this protocol is analyzed at great length from two kinds of attacks including the outside attack and the participant attack. And the analysis result shows that this protocol can withstand various kinds of attacks and be secure to perform efficiently.

•Oct 24, 2017•1 citation

Quantum Private Comparison of Equal Information Based on Highly Entangled Six-Qubit Genuine State

纪兆旭, 叶天语

Using the highly entangled six-qubit genuine state we present a quantum private comparison(QPC)protocol, which enables two users to compare the equality of two bits of their secrets in every round comparison with the assistance of a semi-honest third party(TP). The proposed protocol needs neither unitary operations nor quantum entanglement swapping technology, both of which may consume expensive quantum devices. Single particle measurements and Bell-basis measurements, which are easy to implement with current technologies, are employed by two users and TP in the proposed protocol, respectively. The proposed protocol can withstand all kinds of outside attacks and participant attacks. Moreover, none of information about the two users’ private secrets and the comparison result is leaked out to TP.

理论物理通讯：英文版•Jan 1, 2016•0 citations

Secure dynamic multiparty quantum private comparison

Hussein Abulkasim, Ahmed Farouk, Safwat H. Hamad +2 more

We propose a feasible and efficient dynamic multiparty quantum private comparison protocol that is fully secure against participant attacks. In the proposed scheme, two almost-dishonest third parties generate two random keys and send them to all participants. Every participant independently encrypts their private information with the encryption keys and sends it to the third parties. The third parties can analyze the equality of all or some participants' secrets without gaining access to the secret information. New participants can dynamically join the protocol without the need for any additional conditions in the protocol. We provide detailed correctness and security analysis of the proposed protocol. Our security analysis of the proposed protocol against both inside and outside attacks proves that attackers cannot extract any secret information.

Scientific Reports•Nov 28, 2019•46 citations

Quantum Private Comparison of Equal Information Based on Highly Entangled Six-Qubit Genuine State*

Zhaoxu Ji, Tian-Yu Ye

Abstract Using the highly entangled six-qubit genuine state we present a quantum private comparison (QPC) protocol, which enables two users to compare the equality of two bits of their secrets in every round comparison with the assistance of a semi-honest third party (TP). The proposed protocol needs neither unitary operations nor quantum entanglement swapping technology, both of which may consume expensive quantum devices. Single particle measurements and Bell-basis measurements, which are easy to implement with current technologies, are employed by two users and TP in the proposed protocol, respectively. The proposed protocol can withstand all kinds of outside attacks and participant attacks. Moreover, none of information about the two users' private secrets and the comparison result is leaked out to TP.

Communications in Theoretical Physics•Jun 1, 2016•66 citations
Private Comparison (PC) is an extension of Yao's millionaire problem: two millionaires want to know if their wealth is equal, but they don't want to reveal their specific wealth. In classical cryptography, this problem has been well studied. However, the security issues of these protocols are based on computational complexity assumptions, which means they cannot resist powerful quantum computing. In this paper, a quantum private comparison of equality with better performance in resisting outside attack is proposed based on two parties. Compared with the previous protocol, our protocol greatly reduce the total probability of obtaining the wrong result. And it also can compare successfully even if the two hash value string are short and close. Meanwhile, our protocol can be implemented easily without using entanglement, joint measurements and quantum memory and so on. Finally, we show that our protocol can be secure against the attacks from both the outside eavesdroppers and the inside participants.
In this paper, we present a protocol for generalized secure comparison problem. Yao's millionaire problem is for comparing the wealth of two parties by preserving their privacy. Ifnnnparties want to compare their wealth by using Yao's protocol, it should be run$n(n-1)2times;iftheirwealthintervalisaslargeasN,thecomplexityofYao′sprotocolfor2 times; if their wealth interval is as large as N, the complexity of Yao's protocol for2times;iftheirwealthintervalisaslargeasN,thecomplexityofYao′sprotocolfornpartiesisinorderofN.parties is in order of N.partiesisinorderofN.\mathbf{n}^{2}, \mathbf{i}.\mathbf{e}...\mathbf{O}\ (\mathbf{N}.\mathbf{n}^{2})$. In this paper, we present a generalized secure comparison protocol, which need not to be run by every two parties separately. We use an easy knapsack problem for distinguishing parties' indices. Our protocol computation and communication complexities are bounded by 0 (n).
In this paper, an efficient quantum private comparison (QPC) protocol based on GHZ-type states is proposed. Two participants can compare the equality of two classical bits in each comparison, which could greatly reduce comparison times and increase efficiency. A semi-honest third-party (TP) is involved in assisting the participants to compare their secrets. TP may misbehave on her own, but she is not allowed to conspire with any participants. Besides, the proposed protocol needs Hadamard operation as well as single-particle measurements and Bell measurements, which are easy to implement with current technologies. Finally, the analysis shows the proposed protocol is correct and it can resist various attacks including outside attacks and dishonest participant attacks.
For two participants to compare the equality of their private information without revealing them, a new quantum private protocol with the help of semi-honest third party TP is proposed. Different from previous protocols, the four particle |Wf⟩ state and the |χ+⟩ state are utilized in this protocol as the carriers of quantum information and form the entanglement swapping as basic principle. The simple measurement of quantum states and exclusive-or operation are only required to conduct in this protocol. What’s more, this protocol can compare two bits of two participants’ private information in every comparison time. Meanwhile, it needs no unitary operation to fulfill this protocol. This protocol is feasible and efficient to execute through these aspects. In the end, the security of this protocol is analyzed at great length from two kinds of attacks including the outside attack and the participant attack. And the analysis result shows that this protocol can withstand various kinds of attacks and be secure to perform efficiently.
Using the highly entangled six-qubit genuine state we present a quantum private comparison(QPC)protocol, which enables two users to compare the equality of two bits of their secrets in every round comparison with the assistance of a semi-honest third party(TP). The proposed protocol needs neither unitary operations nor quantum entanglement swapping technology, both of which may consume expensive quantum devices. Single particle measurements and Bell-basis measurements, which are easy to implement with current technologies, are employed by two users and TP in the proposed protocol, respectively. The proposed protocol can withstand all kinds of outside attacks and participant attacks. Moreover, none of information about the two users’ private secrets and the comparison result is leaked out to TP.
We propose a feasible and efficient dynamic multiparty quantum private comparison protocol that is fully secure against participant attacks. In the proposed scheme, two almost-dishonest third parties generate two random keys and send them to all participants. Every participant independently encrypts their private information with the encryption keys and sends it to the third parties. The third parties can analyze the equality of all or some participants' secrets without gaining access to the secret information. New participants can dynamically join the protocol without the need for any additional conditions in the protocol. We provide detailed correctness and security analysis of the proposed protocol. Our security analysis of the proposed protocol against both inside and outside attacks proves that attackers cannot extract any secret information.
Abstract Using the highly entangled six-qubit genuine state we present a quantum private comparison (QPC) protocol, which enables two users to compare the equality of two bits of their secrets in every round comparison with the assistance of a semi-honest third party (TP). The proposed protocol needs neither unitary operations nor quantum entanglement swapping technology, both of which may consume expensive quantum devices. Single particle measurements and Bell-basis measurements, which are easy to implement with current technologies, are employed by two users and TP in the proposed protocol, respectively. The proposed protocol can withstand all kinds of outside attacks and participant attacks. Moreover, none of information about the two users' private secrets and the comparison result is leaked out to TP.