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 quantum secure multi-party ranking protocol

Liu Wen, Yongbin Wang

Published Jan 1, 2011• 2 citations
Publisher

Abstract

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.

DOI
10.7498/aps.60.070301

Related papers

Research of secure two-party quantum comparing protocol

Liu Wen, Yongbin Wang

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.

Acta Physica Sinica•Jan 1, 2011•2 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

Research on Secure Multi-party Ranking Problem and Secure Selection Problem

Cheng Chao, Yonglong Luo, Caixia Chen +1 more

In this paper, the problems of secure multi-party ranking and secure selection were studied. Two protocols were proposed. They were both based on Secure Sum protocol. Secure multi-party ranking problem is an extended problem from millionaires' problem. It can be applied to many fields, such as auctions, commercial enterprises and so on. Secure Sum protocol was used to calculate the sum of vectors. The security and complexity were analyzed in the semi-honest model. In some cases this protocol is better. This paper also studied the problem of secure selection and proposed a protocol using the protocols of Secure Sum and 1-n oblivious transfer. We analyzed the worst case and the average case.

International Conference on Web Information Systems and Mining (WISM)•Oct 1, 2010•5 citations

A Study of Secure Multi-party Ranking Problem

Wen Liu, Shoushan Luo, Ping Chen

In this paper, we study a secure multi-party ranking problem: there are n parties, P1, P2, ... , Pn. Each party Pihas a secret input miisin {1, 2, ... ,N}. He wants to get the order of miin the ascending ranking sequence of the n parties' inputs, while not leaking the value of mi. This problem extends the famous Yao's millionaires' problem form two parties to n parties and is a multi-party Yao's Millionaires' problem. We propose a protocol for solving the secure multi-party ranking problem, using the encoding scheme and the El Gamal cryptosystem. We also prove the correctness and the security of our solution in the semi-honest model. The solution of secure multi-party ranking problem can make new-style electronic transactions, such as private bidding and auction, secret online transaction and so on, become better security.

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)•Jul 1, 2007•23 citations

Implementing quantum anonymous multi-party ranking: the influence and application of the law of large numbers

Qingle Wang, Jiawei Liu, Guodong Li +2 more

Abstract Secure multi-party ranking is not only a pivotal component within the domain of secure multi-party computation but also holds extensive real-world applicability, given its efficacy in safeguarding the integrity and privacy of data. In this paper, we propose a verifiable quantum anonymous multi-party ranking protocol, which leverages the power of multi-particle entangled states in conjunction with the law of large numbers. The protocol achieves the secure ranking of participants’ private data while verifying their identities through the assistance of a semi-honest third party. We prove that the protocol is resistant to different types of attacks from internal or external attackers. In addition, the proposed protocol employs qubits as the information carriers, which improves the feasibility of the protocol. We demonstrate the feasibility of the protocol by using the online analog quantum computer of IBM Corporation placed on the cloud. Our research represents an innovative initiative that merges the realms of quantum cryptography and statistical analysis to address pertinent practical challenges.

Physica Scripta•Jan 30, 2024•1 citation

Research on Secure Multi-Party Closest String Problem

Wen Liu, Yongbin Wang, Yizhen Cao

A secure two-party hamming distance computing protocol is proposed based on the secure two-party matrix product protocol; a secure four-party addition protocol, a secure three-party addition protocol and a secure two-party number protocol are proposed based on the additive homomorphic encryption and secure two-party compare protocol. A secure multi-party closest string protocol is presented based on the secure two-party hamming distance computing protocol and a secure multi-party addition protocol. These protocols are based on semi-honest model.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2011•0 citations
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.
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, the problems of secure multi-party ranking and secure selection were studied. Two protocols were proposed. They were both based on Secure Sum protocol. Secure multi-party ranking problem is an extended problem from millionaires' problem. It can be applied to many fields, such as auctions, commercial enterprises and so on. Secure Sum protocol was used to calculate the sum of vectors. The security and complexity were analyzed in the semi-honest model. In some cases this protocol is better. This paper also studied the problem of secure selection and proposed a protocol using the protocols of Secure Sum and 1-n oblivious transfer. We analyzed the worst case and the average case.
In this paper, we study a secure multi-party ranking problem: there are n parties, P1, P2, ... , Pn. Each party Pihas a secret input miisin {1, 2, ... ,N}. He wants to get the order of miin the ascending ranking sequence of the n parties' inputs, while not leaking the value of mi. This problem extends the famous Yao's millionaires' problem form two parties to n parties and is a multi-party Yao's Millionaires' problem. We propose a protocol for solving the secure multi-party ranking problem, using the encoding scheme and the El Gamal cryptosystem. We also prove the correctness and the security of our solution in the semi-honest model. The solution of secure multi-party ranking problem can make new-style electronic transactions, such as private bidding and auction, secret online transaction and so on, become better security.
Abstract Secure multi-party ranking is not only a pivotal component within the domain of secure multi-party computation but also holds extensive real-world applicability, given its efficacy in safeguarding the integrity and privacy of data. In this paper, we propose a verifiable quantum anonymous multi-party ranking protocol, which leverages the power of multi-particle entangled states in conjunction with the law of large numbers. The protocol achieves the secure ranking of participants’ private data while verifying their identities through the assistance of a semi-honest third party. We prove that the protocol is resistant to different types of attacks from internal or external attackers. In addition, the proposed protocol employs qubits as the information carriers, which improves the feasibility of the protocol. We demonstrate the feasibility of the protocol by using the online analog quantum computer of IBM Corporation placed on the cloud. Our research represents an innovative initiative that merges the realms of quantum cryptography and statistical analysis to address pertinent practical challenges.
A secure two-party hamming distance computing protocol is proposed based on the secure two-party matrix product protocol; a secure four-party addition protocol, a secure three-party addition protocol and a secure two-party number protocol are proposed based on the additive homomorphic encryption and secure two-party compare protocol. A secure multi-party closest string protocol is presented based on the secure two-party hamming distance computing protocol and a secure multi-party addition protocol. These protocols are based on semi-honest model.