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

Physica Scripta

Quantum secure ranking based on quantum walks

Justin Joseph, Syed Taqi Ali

Published Jan 24, 2024• 3 citations
Publisher

Abstract

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.

DOI
10.1088/1402-4896/ad224e

Related papers

Quantum Secure Multiparty Summation Based on Quantum Walks

Justin Joseph, Syed Taqi Ali

We propose an efficient Quantum Secure Multiparty Summation protocol based on quantum walk states. It enables multiple participants to find the sum of all the data without revealing it to anyone else. With the help of quantum walks, we can achieve this with fewer quantum resources and minimal communication costs. The protocol also requires a semi-honest third party (TP) to facilitate the protocol. The semi-honest TP follows the protocol but attacks passively. Finally, we prove its correctness and security, making it a viable solution for quantum secure multiparty summation.

International Conference on Quantum Technologies, Communications, Computing, Hardware and Embedded Systems Security (iQ-CCHESS)•Sep 15, 2023•0 citations

Quantum anonymous ranking

Wei Huang, Qiaoyan Wen, Bin Liu +3 more

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.

Physical Review A•Mar 14, 2014•69 citations

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

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

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

Semi-quantum private comparison and its generalization to the key agreement, summation, and anonymous ranking

Chong‐Qiang Ye, Jian Li, Xiu‐Bo Chen +2 more

Semi-quantum protocols construct connections between quantum users and ``classical'' users who can only perform certain ``classical'' operations. In this paper, we present a new semi-quantum private comparison protocol based on entangled states and single particles, which does not require pre-shared keys between the ``classical'' users to guarantee the security of their private data. By utilizing multi-particle entangled states and single particles, our protocol can be easily extended to multi-party scenarios to meet the requirements of multiple ``classical'' users who want to compare their private data. The security analysis shows that the protocol can effectively prevent attacks from outside eavesdroppers and adversarial participants. Besides, we generalize the proposed protocol to other semi-quantum protocols such as semi-quantum key agreement, semi-quantum summation, and semi-quantum anonymous ranking protocols. We compare and discuss the proposed protocols with previous similar protocols. The results show that our protocols satisfy the demands of their respective counterparts separately. Therefore, our protocols have a wide range of application scenarios.

arXiv:2210.03421•Oct 7, 2022•0 citations
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.
We propose an efficient Quantum Secure Multiparty Summation protocol based on quantum walk states. It enables multiple participants to find the sum of all the data without revealing it to anyone else. With the help of quantum walks, we can achieve this with fewer quantum resources and minimal communication costs. The protocol also requires a semi-honest third party (TP) to facilitate the protocol. The semi-honest TP follows the protocol but attacks passively. Finally, we prove its correctness and security, making it a viable solution for quantum secure multiparty summation.
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.
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.
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.
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.
Semi-quantum protocols construct connections between quantum users and ``classical'' users who can only perform certain ``classical'' operations. In this paper, we present a new semi-quantum private comparison protocol based on entangled states and single particles, which does not require pre-shared keys between the ``classical'' users to guarantee the security of their private data. By utilizing multi-particle entangled states and single particles, our protocol can be easily extended to multi-party scenarios to meet the requirements of multiple ``classical'' users who want to compare their private data. The security analysis shows that the protocol can effectively prevent attacks from outside eavesdroppers and adversarial participants. Besides, we generalize the proposed protocol to other semi-quantum protocols such as semi-quantum key agreement, semi-quantum summation, and semi-quantum anonymous ranking protocols. We compare and discuss the proposed protocols with previous similar protocols. The results show that our protocols satisfy the demands of their respective counterparts separately. Therefore, our protocols have a wide range of application scenarios.