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

Physical Review A

Quantum anonymous ranking

Wei Huang, Qiaoyan Wen, Bin Liu, Qi Su, Su‐Juan Qin, Fei Gao

Published Mar 14, 2014• 69 citations
Publisher

Abstract

Anonymous ranking is a kind of privacy-preserving ranking whereby each of the involved participants can correctly and anonymously get the rankings of his data. It can be utilized to solve many practical problems, such as anonymously ranking the students' exam scores. We investigate the issue of how quantum mechanics can be of use in maintaining the anonymity of the participants in multiparty ranking and present a series of quantum anonymous multiparty, multidata ranking protocols. In each of these protocols, a participant can get the correct rankings of his data and nobody else can match the identity to his data. Furthermore, the security of these protocols with respect to different kinds of attacks is proved.

DOI
10.1103/physreva.89.032325

Related papers

Quantum secure ranking based on quantum walks

Justin Joseph, Syed Taqi Ali

Abstract We propose a quantum secure multiparty multidata ranking (QSMMR) protocol based on quantum walks. Our protocol improves the traditional anonymous ranking protocol to secure ranking, where we ensure the confidentiality of the data. A quantum anonymous ranking protocol exposes all participants’ data, which is not ideal for practical scenarios such as personal wealth and health indexes. Hence, we propose the first quantum secure ranking protocol with semi-honest TP, that generates ranking for multiple data of multiple participants by keeping data completely secure. We use quantum resources to assign a random address to all participants, to perform comparison, and for the eavesdropper detection. Finally, we analyze and prove the security of the protocol.

Physica Scripta•Jan 24, 2024•3 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

A transferable quantum anonymous ranking protocol without third party

Xinyue Mao, Huixin Sun, Jiuru Wang +2 more

Quantum Anonymous Multi-party Ranking (QAMR) enables quantum ranking operations to be performed on private datasets while concealing associations between participants and their private data. However, most existing protocols rely on semi-honest third parties and require the use of a large number of quantum states to ensure identity anonymity. Furthermore, they lack transferability due to inadequate modular design. To address these issues, a novel QAMR protocol is proposed, which eliminates the need for semi-honest third parties for the first time. The protocol achieves reduced quantum resource consumption while ensuring transferability. Moreover, the protocol’s correctness is proven by theoretical analysis, and its feasibility is confirmed via IBM Qiskit simulations. A thorough security analysis shows that the protocol is resistant to collusion, entanglement-measurement, and intercept-resend attacks. Besides, the comparison shows that the suggested approach uses fewer quantum resources while processing datasets with wider distributions and higher limits.

EPJ Quantum Technology•Sep 29, 2025•2 citations

Self-tallying quantum anonymous voting

Qingle Wang, Chao‐Hua Yu, Fei Gao +2 more

Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils and companies. In this paper, we propose a quantum anonymous voting protocol assisted by two kinds of entangled quantum states. Particularly, we provide a mechanism of opening and permuting the ordered votes of all the voters in an anonymous manner; any party who is interested in the voting results can acquire a permutation copy and then obtains the voting result through a simple calculation. Unlike all previous quantum works on anonymous voting, our quantum anonymous protocol possesses the properties of privacy, self-tallying, nonreusability, verifiability, and fairness at the same time. In addition, we demonstrate that the entanglement of the quantum states used in our protocol makes an attack from an outside eavesdropper and inside dishonest voters impossible. We also generalize our protocol to execute the task of anonymous multiparty computation, such as anonymous broadcast and anonymous ranking.

arXiv:1605.07942•Physical Review A•Aug 24, 2016•81 citations

Quantum anonymous ranking based on the Chinese remainder theorem

Song Lin, Gongde Guo, Feng Hua Huang +1 more

In this paper, an efficient quantum anonymous ranking protocol with single particles is proposed. A semitrusted server is introduced to help multiple users achieve this secure task. At the end of the protocol, each user can obtain the rankings of his private data, and keep these data secret. The Chinese remainder theorem is utilized to reduce the level of signal particles and to improve the efficiency of the presented protocol. Meanwhile, a secret transmission order of the signal particles is used to keep the traveling particles secure. Finally, we discuss the security of this protocol and prove it to be secure against certain common attacks under ideal conditions.

Physical Review A•Jan 11, 2016•35 citations

Privacy Preserving Quantum Anonymous Transmission via Entanglement Relay

Wei Yang, Liusheng Huang, Fang Song

Anonymous transmission is an interesting and crucial issue in computer communication area, which plays a supplementary role to data privacy. In this paper, we put forward a privacy preserving quantum anonymous transmission protocol based on entanglement relay, which constructs anonymous entanglement from EPR pairs instead of multi-particle entangled state, e.g. GHZ state. Our protocol achieves both sender anonymity and receiver anonymity against an active adversary and tolerates any number of corrupt participants. Meanwhile, our protocol obtains an improvement in efficiency compared to quantum schemes in previous literature.

Scientific Reports•Jun 1, 2016•17 citations
Anonymous ranking is a kind of privacy-preserving ranking whereby each of the involved participants can correctly and anonymously get the rankings of his data. It can be utilized to solve many practical problems, such as anonymously ranking the students' exam scores. We investigate the issue of how quantum mechanics can be of use in maintaining the anonymity of the participants in multiparty ranking and present a series of quantum anonymous multiparty, multidata ranking protocols. In each of these protocols, a participant can get the correct rankings of his data and nobody else can match the identity to his data. Furthermore, the security of these protocols with respect to different kinds of attacks is proved.
Abstract We propose a quantum secure multiparty multidata ranking (QSMMR) protocol based on quantum walks. Our protocol improves the traditional anonymous ranking protocol to secure ranking, where we ensure the confidentiality of the data. A quantum anonymous ranking protocol exposes all participants’ data, which is not ideal for practical scenarios such as personal wealth and health indexes. Hence, we propose the first quantum secure ranking protocol with semi-honest TP, that generates ranking for multiple data of multiple participants by keeping data completely secure. We use quantum resources to assign a random address to all participants, to perform comparison, and for the eavesdropper detection. Finally, we analyze and prove the security of the protocol.
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.
Quantum Anonymous Multi-party Ranking (QAMR) enables quantum ranking operations to be performed on private datasets while concealing associations between participants and their private data. However, most existing protocols rely on semi-honest third parties and require the use of a large number of quantum states to ensure identity anonymity. Furthermore, they lack transferability due to inadequate modular design. To address these issues, a novel QAMR protocol is proposed, which eliminates the need for semi-honest third parties for the first time. The protocol achieves reduced quantum resource consumption while ensuring transferability. Moreover, the protocol’s correctness is proven by theoretical analysis, and its feasibility is confirmed via IBM Qiskit simulations. A thorough security analysis shows that the protocol is resistant to collusion, entanglement-measurement, and intercept-resend attacks. Besides, the comparison shows that the suggested approach uses fewer quantum resources while processing datasets with wider distributions and higher limits.
Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils and companies. In this paper, we propose a quantum anonymous voting protocol assisted by two kinds of entangled quantum states. Particularly, we provide a mechanism of opening and permuting the ordered votes of all the voters in an anonymous manner; any party who is interested in the voting results can acquire a permutation copy and then obtains the voting result through a simple calculation. Unlike all previous quantum works on anonymous voting, our quantum anonymous protocol possesses the properties of privacy, self-tallying, nonreusability, verifiability, and fairness at the same time. In addition, we demonstrate that the entanglement of the quantum states used in our protocol makes an attack from an outside eavesdropper and inside dishonest voters impossible. We also generalize our protocol to execute the task of anonymous multiparty computation, such as anonymous broadcast and anonymous ranking.
In this paper, an efficient quantum anonymous ranking protocol with single particles is proposed. A semitrusted server is introduced to help multiple users achieve this secure task. At the end of the protocol, each user can obtain the rankings of his private data, and keep these data secret. The Chinese remainder theorem is utilized to reduce the level of signal particles and to improve the efficiency of the presented protocol. Meanwhile, a secret transmission order of the signal particles is used to keep the traveling particles secure. Finally, we discuss the security of this protocol and prove it to be secure against certain common attacks under ideal conditions.
Anonymous transmission is an interesting and crucial issue in computer communication area, which plays a supplementary role to data privacy. In this paper, we put forward a privacy preserving quantum anonymous transmission protocol based on entanglement relay, which constructs anonymous entanglement from EPR pairs instead of multi-particle entangled state, e.g. GHZ state. Our protocol achieves both sender anonymity and receiver anonymity against an active adversary and tolerates any number of corrupt participants. Meanwhile, our protocol obtains an improvement in efficiency compared to quantum schemes in previous literature.