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

arXiv:2110.13648

Anonymous multi-party quantum computation with a third party

Zhaoxu Ji, Peiru Fan, Atta Ur Rahman, Huanguo Zhang

Published Oct 23, 2021• 1 citation
arXivHTMLPDF

Abstract

We reconsider and modify the second secure multi-party quantum addition protocol proposed in our original work. We show that the protocol is an anonymous multi-party quantum addition protocol rather than a secure multi-party quantum addition protocol. Through small changes, we develop the protocol to propose, for the first time, anonymous multiparty quantum computation with a third party, who faithfully executes protocol processes, but is interested in the identity of the data owners. Further, we propose a new anonymous multiparty quantum protocol based on our original protocol. We calculate the success probability of the proposed protocols, which is also a modification of the success probability of the original protocols.

DOI
10.48550/arxiv.2110.13648

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

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

An efficient secure multiparty quantum computation protocol

Song Lin, Ning Wang, LIU Xiao-Fen

Secure multiparty computing is an important class of cryptographic primitives and is widely used in electronic voting, data mining, blockchain, cloud computing and other fields. In this paper, we propose an efficient secure multiparty quantum computation protocol based on quantum entanglement and the Euler theorem. In this protocol, all participants can safely compute multivariate polynomial functions with the help of a semitrusted third party. A performance analysis shows that the protocol is correct and can resist some common external and internal attacks. Additionally, the proposed protocol not only improves particle detection efficiency but also effectively reduces the communication complexity.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Feb 15, 2023•8 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•84 citations

Quantum anonymous selection and its applications

Runhua Shi, Xia-qin Fang

In this paper, we introduce what we believe to be a novel cryptographic primitive in secure multiparty computation, called anonymous selection (AS). This cryptographic primitive involves the random and anonymous selection of one participant from a group, ensuring that no one, except the selected individual, can identify who has been chosen. The AS concept holds significant potential for simplifying complex cryptographic tasks by enabling their implementation in a sequential manner rather than a synchronous one. To develop an efficient and practical AS protocol, we first propose two new primitive protocols: a measurement-device-independent (MDI) quantum secure multiparty XOR protocol and an MDI quantum collision detection protocol. Leveraging these protocols, we construct an innovative quantum AS protocol that achieves information-theoretic security under the semi-honest model. Furthermore, we explore the practical applications of the quantum AS protocol and present a feasible quantum protocol for secure multiparty logical multiplication. Our theoretical analysis and simulation experiments collectively demonstrate the feasibility of the proposed quantum protocols.

Optics Express•Apr 15, 2025•0 citations

A new quantum secure multiparty summation protocol with locally indistinguishable orthogonal product states

Kunchi Hou, Sijia Fu, Dongze Li +2 more

As an important branch of quantum-secure multiparty computation, quantum-secure multiparty summation enables participants to complete the summation of their inputs without revealing their own secrets. In this paper, a new multiparty quantum secure summation protocol based on locally indistinguishable orthogonal product (LIOP) states is proposed. Leveraging the properties of LIOP states, participants can successfully accomplish the summation of their secrets with the assistance of a semi-honest third party (TP). The present protocol is shown to effectively resist certain existing attacks. Furthermore, complex operations and entanglement resources are not required in the proposed protocol. We anticipate that these results will contribute positively to the future development of quantum-secure multiparty computation.

International Journal of Quantum Information•May 31, 2024•0 citations
We reconsider and modify the second secure multi-party quantum addition protocol proposed in our original work. We show that the protocol is an anonymous multi-party quantum addition protocol rather than a secure multi-party quantum addition protocol. Through small changes, we develop the protocol to propose, for the first time, anonymous multiparty quantum computation with a third party, who faithfully executes protocol processes, but is interested in the identity of the data owners. Further, we propose a new anonymous multiparty quantum protocol based on our original protocol. We calculate the success probability of the proposed protocols, which is also a modification of the success probability of the original protocols.
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.
Secure multiparty computing is an important class of cryptographic primitives and is widely used in electronic voting, data mining, blockchain, cloud computing and other fields. In this paper, we propose an efficient secure multiparty quantum computation protocol based on quantum entanglement and the Euler theorem. In this protocol, all participants can safely compute multivariate polynomial functions with the help of a semitrusted third party. A performance analysis shows that the protocol is correct and can resist some common external and internal attacks. Additionally, the proposed protocol not only improves particle detection efficiency but also effectively reduces the communication complexity.
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, we introduce what we believe to be a novel cryptographic primitive in secure multiparty computation, called anonymous selection (AS). This cryptographic primitive involves the random and anonymous selection of one participant from a group, ensuring that no one, except the selected individual, can identify who has been chosen. The AS concept holds significant potential for simplifying complex cryptographic tasks by enabling their implementation in a sequential manner rather than a synchronous one. To develop an efficient and practical AS protocol, we first propose two new primitive protocols: a measurement-device-independent (MDI) quantum secure multiparty XOR protocol and an MDI quantum collision detection protocol. Leveraging these protocols, we construct an innovative quantum AS protocol that achieves information-theoretic security under the semi-honest model. Furthermore, we explore the practical applications of the quantum AS protocol and present a feasible quantum protocol for secure multiparty logical multiplication. Our theoretical analysis and simulation experiments collectively demonstrate the feasibility of the proposed quantum protocols.
As an important branch of quantum-secure multiparty computation, quantum-secure multiparty summation enables participants to complete the summation of their inputs without revealing their own secrets. In this paper, a new multiparty quantum secure summation protocol based on locally indistinguishable orthogonal product (LIOP) states is proposed. Leveraging the properties of LIOP states, participants can successfully accomplish the summation of their secrets with the assistance of a semi-honest third party (TP). The present protocol is shown to effectively resist certain existing attacks. Furthermore, complex operations and entanglement resources are not required in the proposed protocol. We anticipate that these results will contribute positively to the future development of quantum-secure multiparty computation.