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

EPJ Quantum Technology

A transferable quantum anonymous ranking protocol without third party

Xinyue Mao, Huixin Sun, Jiuru Wang, Kejia Zhang, Bao-Min Zhou

Published Sep 29, 2025• 2 citations
Publisher

Abstract

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.

DOI
10.1140/epjqt/s40507-025-00422-6

Related papers

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

Novel semi-quantum private comparison protocol with Bell states

Li‐Hua Gong, Mao-Long Li, Hao Cao +1 more

Abstract Based on Bell states, a new semi-quantum private comparison protocol is proposed that enables two classical users to securely compare the equality of their private information with the aid of a semi-honest third party. Different from the existing semi-quantum private comparison protocols, the two classical participants in the presented protocol do not need to measure and prepare any quantum state, which not only reduces the consumption of quantum devices, but also greatly improves the feasibility of the protocol. Performing different unitary operations on the received particles, classical users can securely compare their secret information. Besides, the devised protocol has higher qubit efficiency than the other similar counterparts, since participants can compare a two-bit privacy each time with one qubit. Meanwhile, after completing the comparison process, all Bell states could be reused since they still retain the corresponding entanglement property, which greatly facilitates the recycle of quantum resources. Security analyses indicate that the designed scheme is secure against external attack and internal attack. Moreover, the operations involved in our scheme are simulated on the IBM Quantum Experience to demonstrate the effectiveness and security of our scheme.

Laser Physics Letters•Apr 10, 2024•60 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

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

Quantum Anonymity for Quantum Networks

Awais Ali Khan, Junaid ur Rehman, Hyundong Shin

We present the first quantum anonymous notification (QAN) protocol that introduces anonymity and paves the way for anonymous secure quantum communication in quantum networks. QAN protocol has applications ranging from multiparty quantum computation to quantum internet. We utilize the QAN protocol to propose an anonymous quantum private comparison protocol in an $n$-node quantum network. This protocol can compare private information of any $2 \leq k \leq n$ parties with the help of the remaining $n-k$ parties and a semi-honest third party. These protocols feature a traceless property, i.e., encoding operations cannot be traced back to their originating sources. Security analysis shows that this protocol is robust against external adversaries and malicious participants.

arXiv:2007.11176•Jul 22, 2020•2 citations

Multiparty semi-quantum key agreement protocol without participant measurement

Jing Li, Jiaxin Xiong, Xianmin Wang

Abstract The semi-quantum key agreement (SQKA) protocol enables classical participants to complete key agreement with limited quantum capabilities. The previous semi-quantum key agreement protocols required the classical party to have the ability to measure qubits, and share a key before the protocol began. This paper proposes a SQKA protocol that allows semi-quantum participants to use single photons for key negotiation with the help of a semi-honest third party (TP). Unlike previous approaches, this protocol further reduces the quantum capability requirements for participants and eliminates the need for prior key sharing. Furthermore, through security analysis and multi-party expansion, the protocol can resist external attacks such as the intercept-resend attack, measure-resend attack, entangle-measure attack. Additionally, it can be applied to scenarios involving different numbers of participants.

Physica Scripta•Sep 1, 2025•3 citations
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.
Abstract Based on Bell states, a new semi-quantum private comparison protocol is proposed that enables two classical users to securely compare the equality of their private information with the aid of a semi-honest third party. Different from the existing semi-quantum private comparison protocols, the two classical participants in the presented protocol do not need to measure and prepare any quantum state, which not only reduces the consumption of quantum devices, but also greatly improves the feasibility of the protocol. Performing different unitary operations on the received particles, classical users can securely compare their secret information. Besides, the devised protocol has higher qubit efficiency than the other similar counterparts, since participants can compare a two-bit privacy each time with one qubit. Meanwhile, after completing the comparison process, all Bell states could be reused since they still retain the corresponding entanglement property, which greatly facilitates the recycle of quantum resources. Security analyses indicate that the designed scheme is secure against external attack and internal attack. Moreover, the operations involved in our scheme are simulated on the IBM Quantum Experience to demonstrate the effectiveness and security of our scheme.
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.
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 present the first quantum anonymous notification (QAN) protocol that introduces anonymity and paves the way for anonymous secure quantum communication in quantum networks. QAN protocol has applications ranging from multiparty quantum computation to quantum internet. We utilize the QAN protocol to propose an anonymous quantum private comparison protocol in an nnn-node quantum network. This protocol can compare private information of any 2≤k≤n2 \leq k \leq n2≤k≤n parties with the help of the remaining n−kn-kn−k parties and a semi-honest third party. These protocols feature a traceless property, i.e., encoding operations cannot be traced back to their originating sources. Security analysis shows that this protocol is robust against external adversaries and malicious participants.
Abstract The semi-quantum key agreement (SQKA) protocol enables classical participants to complete key agreement with limited quantum capabilities. The previous semi-quantum key agreement protocols required the classical party to have the ability to measure qubits, and share a key before the protocol began. This paper proposes a SQKA protocol that allows semi-quantum participants to use single photons for key negotiation with the help of a semi-honest third party (TP). Unlike previous approaches, this protocol further reduces the quantum capability requirements for participants and eliminates the need for prior key sharing. Furthermore, through security analysis and multi-party expansion, the protocol can resist external attacks such as the intercept-resend attack, measure-resend attack, entangle-measure attack. Additionally, it can be applied to scenarios involving different numbers of participants.