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

Acta Physica Sinica

Research of secure two-party quantum comparing protocol

Liu Wen, Yongbin Wang

Published Jan 1, 2011• 2 citations
Publisher

Abstract

Secure two-party comparing problem is used to compare two private integer without further leaking of information. But in case of the quantum computer the currently available solutions become useless. A secure two-party quantum comparing protocol in semi-honest model is presented based on the a quantum implicit module n+1 addition. The security of the protocol is analyzed.

DOI
10.7498/aps.60.030305

Related papers

Research of quantum secure multi-party ranking protocol

Liu Wen, Yongbin Wang

Secure multi-party ranking problem is used to rank n private integers without leaking further information. It is an extended problem of secure two-party comparing problem. A secure multi-party quantum ranking protocol in semi-honest model is presented based on the a quantum implicit module n+1 addition. The security for multi-parties of the protocol is analyzed.

Acta Physica Sinica•Jan 1, 2011•2 citations

Quantum private comparison of arbitrary single qubit states based on swap test

Xi Huang, Yan Chang, Wen Cheng +2 more

By using swap test, a quantum private comparison (QPC) protocol of arbitrary single qubit states with a semi-honest third party is proposed. The semi-honest third party (TP) is required to help two participants perform the comparison. She can record intermediate results and do some calculations in the whole process of the protocol execution, but she cannot conspire with any of participants. In the process of comparison, the TP cannot get two participants’ private information except the comparison results. According to the security analysis, the proposed protocol can resist both outsider attacks and participants’ attacks. Compared with the existing QPC protocols, the proposed one does not require any entanglement swapping technology, but it can compare two participants’ qubits by performing swap test, which is easier to implement with current technology. Meanwhile, the proposed protocol can compare secret integers. It encodes secret integers into the amplitude of quantum state rather than transfer them as binary representations, and the encoded quantum state is compared by performing the swap test. Additionally, the proposed QPC protocol is extended to the QPC of arbitrary single qubit states by using multi-qubit swap test.

Chinese Physics B•Dec 8, 2021•26 citations

Secure two-party comparing protocol based on evaluation of encrypted functions

Liang Chen, Yong Xu

Secure two-party comparing is a special case and a basic module of secure computations,and is applied in mobile code and e-commerce security etc.But known solutions have some disadvantages:expensive costs of computing and communicating,limited ranges of compared numbers.Based on a modified ElGamal algorithm,this paper presented and proved multiplicative,mixed-multiplicative,additive and subtractive homomorphic cryptosystem.Constructed an encrypted function unknown by two-party using the homomorphic cryptosystem.Based on the homomorphic cryptosystem and evaluation of encrypted functions,designed secure two-party comparing protocol under semi-honest model.Proof,example and comparing with other protocols show the proposed protocol has the merits of security,fairness,lower costs of communication and computational complexity,and comparing integers.

Jisuanji yingyong yanjiu•Jan 1, 2010•0 citations

Quantum Private Comparison Protocol Based on Bell Entangled States

Wen Liu, Yongbin Wang, Wei Cui

In this paper, a quantum private comparison protocol is proposed based on bell entangled states. In our protocol, two parties can compare the equality of their information with the help of a semi-honest third party. The correctness and security of our protocol are discussed. One party cannot learn the other's private information and the third party also cannot learn any information about the private information.

Communications in Theoretical Physics•Apr 1, 2012•98 citations

Research on the Problem of Secure Multi-party Ranking Under Semi-honest Model

Bo Wu

Secure multi-party ranking is a problem generalized from the millionaires' problem,which can be used by n people to know about their secrets' order among all their inputs without leaking further information.Through the study on millionaires' protocol,we presented a secure two-party ranking protocol under semi-honest model based on homomorphic encryption.Then we generalized it to secure multi-party ranking,and we presented two algorithms whose efficiency are both improved.Finally,we gave a secure multi-party ranking protocol based on fuzzy nearness degree,and we analyzed the efficiency and security of these protocols.

Dianzi xuebao•Jan 1, 2008•3 citations

Quantum Private Comparison Without Entanglement

YU Chao-hu

In this paper,a quantum private comparison protocol based on d dimensional single-particle states is proposed. In the protocol,a semi-honest third party transfers a sequence of n particles to one participant w ho encodes n secret keys by performing n local unitary operations. Then these particles are sent to the other participant w ho also by the same w ay encodes n secret keys and returns these particles back to the semi-honest party. Finally after the participants broadcast the results of encrypting their secrets w ith secret keys,the semi-honest third party can help the tw o participants compare the size relationships of their n pair corresponding secrets w ithout disclosing them to any other people. In addition,the security of the protocol is also discussed in detail. It is show n that the protocol is secure in theory. Moreover,since only single-particle states are used,as compared w ith other quantum private comparison protocols,the presented protocol is more feasible under the current technical conditions.

Journal of Chinese Computer Systems•Jan 1, 2014•1 citation
Secure two-party comparing problem is used to compare two private integer without further leaking of information. But in case of the quantum computer the currently available solutions become useless. A secure two-party quantum comparing protocol in semi-honest model is presented based on the a quantum implicit module n+1 addition. The security of the protocol is analyzed.
By using swap test, a quantum private comparison (QPC) protocol of arbitrary single qubit states with a semi-honest third party is proposed. The semi-honest third party (TP) is required to help two participants perform the comparison. She can record intermediate results and do some calculations in the whole process of the protocol execution, but she cannot conspire with any of participants. In the process of comparison, the TP cannot get two participants’ private information except the comparison results. According to the security analysis, the proposed protocol can resist both outsider attacks and participants’ attacks. Compared with the existing QPC protocols, the proposed one does not require any entanglement swapping technology, but it can compare two participants’ qubits by performing swap test, which is easier to implement with current technology. Meanwhile, the proposed protocol can compare secret integers. It encodes secret integers into the amplitude of quantum state rather than transfer them as binary representations, and the encoded quantum state is compared by performing the swap test. Additionally, the proposed QPC protocol is extended to the QPC of arbitrary single qubit states by using multi-qubit swap test.
Secure two-party comparing is a special case and a basic module of secure computations,and is applied in mobile code and e-commerce security etc.But known solutions have some disadvantages:expensive costs of computing and communicating,limited ranges of compared numbers.Based on a modified ElGamal algorithm,this paper presented and proved multiplicative,mixed-multiplicative,additive and subtractive homomorphic cryptosystem.Constructed an encrypted function unknown by two-party using the homomorphic cryptosystem.Based on the homomorphic cryptosystem and evaluation of encrypted functions,designed secure two-party comparing protocol under semi-honest model.Proof,example and comparing with other protocols show the proposed protocol has the merits of security,fairness,lower costs of communication and computational complexity,and comparing integers.
Secure multi-party ranking is a problem generalized from the millionaires' problem,which can be used by n people to know about their secrets' order among all their inputs without leaking further information.Through the study on millionaires' protocol,we presented a secure two-party ranking protocol under semi-honest model based on homomorphic encryption.Then we generalized it to secure multi-party ranking,and we presented two algorithms whose efficiency are both improved.Finally,we gave a secure multi-party ranking protocol based on fuzzy nearness degree,and we analyzed the efficiency and security of these protocols.
In this paper,a quantum private comparison protocol based on d dimensional single-particle states is proposed. In the protocol,a semi-honest third party transfers a sequence of n particles to one participant w ho encodes n secret keys by performing n local unitary operations. Then these particles are sent to the other participant w ho also by the same w ay encodes n secret keys and returns these particles back to the semi-honest party. Finally after the participants broadcast the results of encrypting their secrets w ith secret keys,the semi-honest third party can help the tw o participants compare the size relationships of their n pair corresponding secrets w ithout disclosing them to any other people. In addition,the security of the protocol is also discussed in detail. It is show n that the protocol is secure in theory. Moreover,since only single-particle states are used,as compared w ith other quantum private comparison protocols,the presented protocol is more feasible under the current technical conditions.