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

arXiv:1604.06834 · International Journal of Quantum Information

Quantum private comparison protocol without a third party

Guang Ping He

Published Mar 1, 2017• 17 citations
arXivHTMLPDF

Abstract

To evade the well-known impossibility of unconditionally secure quantum two-party computations, previous quantum private comparison protocols have to adopt a third party. Here, we study how far we can go with two parties only. We propose a very feasible and efficient protocol. Intriguingly, although the average amount of information leaked cannot be made arbitrarily small, we find that this average will not exceed 14 bits for any length of the bit-string being compared.

DOI
10.1142/s0219749917500149

Related papers

Device-independent quantum private comparison protocol without a third party

Guang Ping He

Abstract Since unconditionally secure quantum two-party computations are known to be impossible, most existing quantum private comparison (QPC) protocols adopted a third party. Recently, we proposed a QPC protocol which involves two parties only, and showed that although it is not unconditionally secure, it only leaks an extremely small amount of information to the other party. Here we further propose the device-independent version of the protocol, so that it can be more convenient and dependable in practical applications.

arXiv:1710.05051•Physica Scripta•Jul 4, 2018•7 citations

SIMPLE QUANTUM PROTOCOLS FOR THE MILLIONAIRE PROBLEM WITH A SEMI-HONEST THIRD PARTY

Guang Ping He

Recently there were many quantum protocols devoted to solve the millionaire problem and private comparison problem by adding a semi-honest third party. They all require complicated quantum methods, while still leak a non-trivial amount of information to at least one of the parties. But it will be shown here that once the third party is introduced, there can be protocols which is very simple in the sense that they require quantum key distribution as the only quantum resource. Meanwhile, the amount of information leaked can be made arbitrarily small. Furthermore, in most previous protocols the third party can spoil the protocols without being detected. In our protocol such cheating can also be avoided, so that the only constraint left is that the third party should not conspire with another participant. Thus our solutions surpass all existing protocols on both feasibility and security.

arXiv:1207.6739•International Journal of Quantum Information•Mar 1, 2013•15 citations

Secure quantum private comparison

Yu‐Guang Yang, Weifeng Cao, Qiaoyan Wen

We propose a two-party quantum private comparison protocol using single photons, in which two distrustful parties can compare whether their secrets are equal with the help of a third party (TP). Any information about the values of their respective secrets will not be leaked out even with a compromised TP. Security is also discussed.

Physica Scripta•Nov 18, 2009•132 citations

An efficient two-party quantum private comparison protocol with decoy photons and two-photon entanglement

Yu‐Guang Yang, Qiaoyan Wen

Following some ideas of the quantum secret sharing (QSS) protocol (2008, Phys. Lett. A 372 , 1957), we propose an efficient quantum private comparison (QPC) protocol for comparing information of equality with the help of a third party (TP). The protocol can ensure fairness, efficiency and security. The protocol is fair, which means that one party knows the sound result of the comparison if and only if the other one knows the result. The protocol is efficient with the help of the TP for calculating. However, the TP cannot learn any information about the players' respective private inputs and even about the comparison result and cannot collude with any player. The protocol is secure for the two players, that is, any information about their respective secret inputs will not leak except the final computation result. A precise proof of security of the protocol is presented. Applications of this protocol may include private bidding and auctions, secret ballot elections, commercial business, identification in a number of scenarios and so on.

Journal of Physics A Mathematical and Theoretical•Jan 6, 2009•348 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

Semi-quantum private comparison protocol under an almost-dishonest third party

Wen-Han Chou, Tzonelih Hwang, Jun Gu

This study presents the first semi-quantum private comparison protocol under an almost-dishonest third party. The proposed protocol allows two classical participants to compare their secret information without compromising it's privacy. The security analyses indicate that the protocol is free from several well-known attacks.

arXiv:1607.07961•Jul 27, 2016•34 citations
To evade the well-known impossibility of unconditionally secure quantum two-party computations, previous quantum private comparison protocols have to adopt a third party. Here, we study how far we can go with two parties only. We propose a very feasible and efficient protocol. Intriguingly, although the average amount of information leaked cannot be made arbitrarily small, we find that this average will not exceed 14 bits for any length of the bit-string being compared.
Abstract Since unconditionally secure quantum two-party computations are known to be impossible, most existing quantum private comparison (QPC) protocols adopted a third party. Recently, we proposed a QPC protocol which involves two parties only, and showed that although it is not unconditionally secure, it only leaks an extremely small amount of information to the other party. Here we further propose the device-independent version of the protocol, so that it can be more convenient and dependable in practical applications.
Recently there were many quantum protocols devoted to solve the millionaire problem and private comparison problem by adding a semi-honest third party. They all require complicated quantum methods, while still leak a non-trivial amount of information to at least one of the parties. But it will be shown here that once the third party is introduced, there can be protocols which is very simple in the sense that they require quantum key distribution as the only quantum resource. Meanwhile, the amount of information leaked can be made arbitrarily small. Furthermore, in most previous protocols the third party can spoil the protocols without being detected. In our protocol such cheating can also be avoided, so that the only constraint left is that the third party should not conspire with another participant. Thus our solutions surpass all existing protocols on both feasibility and security.
Following some ideas of the quantum secret sharing (QSS) protocol (2008, Phys. Lett. A 372 , 1957), we propose an efficient quantum private comparison (QPC) protocol for comparing information of equality with the help of a third party (TP). The protocol can ensure fairness, efficiency and security. The protocol is fair, which means that one party knows the sound result of the comparison if and only if the other one knows the result. The protocol is efficient with the help of the TP for calculating. However, the TP cannot learn any information about the players' respective private inputs and even about the comparison result and cannot collude with any player. The protocol is secure for the two players, that is, any information about their respective secret inputs will not leak except the final computation result. A precise proof of security of the protocol is presented. Applications of this protocol may include private bidding and auctions, secret ballot elections, commercial business, identification in a number of scenarios and so on.
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.