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

Optics Express

Quantum anonymous selection and its applications

Runhua Shi, Xia-qin Fang

Published Apr 15, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1364/oe.558206

Related papers

Decentralized quantum anonymous veto voting scheme based on measurement-device-independence

Xiaotong Xu, Runhua Shi, Weiyang Ke

Abstract To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.

Physica Scripta•Aug 14, 2023•6 citations

Cloud-assisted quantum primitive protocols and applications

Xia-qin Fang, Runhua Shi

Abstract Security and privacy have always been key concerns for individuals in various cloud-assisted services. In order to enhance security, we focus on quantum cryptography in novel cloud-based applications. First, we present two quantum primitive protocols to compute XOR of two private bits and AND of two private bits with the assistance of a quantum cloud, respectively. Then, we generalize two-party protocols to the corresponding multi-party cases. These quantum primitive protocols can ensure information-theoretical security and provide long-term security, which are guaranteed by the principles of quantum mechanics. Furthermore, we present a grouping strategy to improve the communication efficiency of multiparty quantum protocols. In addition, we investigate privacy-preserving applications of these quantum primitive protocols in cloud-based environments, e.g., cloud-based Anonymous Voting and Multiparty Private Set Intersection. Finally, simulated experiments show our proposed quantum protocols are correct and feasible with the present quantum technology.

Physica Scripta•Aug 17, 2023•3 citations

Device-Independent Anonymous Communication in Quantum Networks

Srijani Das, Manasi Patra, Tuhin Paul +2 more

Anonymity is a fundamental cryptographic primitive that hides the identities of both senders and receivers during message transmission over a network. Classical protocols cannot provide information-theoretic security for such task, and existing quantum approaches typically depend on classical subroutines and multiple private channels, thereby weakening their security in fully adversarial settings. In this work, we introduce the first fully quantum protocol for anonymous communication in realistic quantum networks with a device-independent security proof.

quant-pharXiv:2512.21047•Dec 25, 2025•0 citations

Edge-assisted quantum protocol for secure multiparty logical AND its applications

Runhua Shi, Xia-qin Fang

Security and privacy have always been key concerns for individuals in various edge-assisted services. In this paper, we present a feasible quantum solution to an important primitive of secure multiparty computations, i.e., Secure Multiparty Logical AND (SMLA), in which n participants can securely compute logical AND of n private bits. In order to ensure perfect security and achieve good feasibility, we introduce a semi-honest edge server and two non-collusive fog nodes, and design a secure and feasible edge-assisted quantum protocol for SMLA, which cleverly utilizes Secure Multiparty XOR to implement SMLA group by group. Furthermore, we focus on applications of this quantum primitive protocol and design two quantum protocols for Multiple Private Set Intersection and Anonymous One-vote Veto. Compared with classical related protocols, our proposed quantum protocols obtain higher security, which can be guaranteed by the basic principles of quantum mechanics.

iScience•May 29, 2023•7 citations

Quantum anonymous collision detection for quantum networks

Awais Khan, Uman Khalid, Junaid ur Rehman +2 more

Abstract Quantum mechanics offers new opportunities for diverse information processing tasks in communication and computational networks. In the last two decades, the notion of quantum anonymity has been introduced in several networking tasks that provide an unconditional secrecy of identity for the communicating parties. In this article, we propose a quantum anonymous collision detection (QACD) protocol which detects not only the collision but also guarantees the anonymity in the case of multiple senders. We show that the QACD protocol serves as an important primitive for a quantum anonymous network that features tracelessness and resource efficiency. Furthermore, the security analysis shows that this protocol is robust against the adversary and malicious participants.

EPJ Quantum Technology•Dec 1, 2021•16 citations

MDI quantum protocol for anonymous countable veto voting

Hui Yu, Runhua Shi, Weiyang Ke

Abstract In order to construct unconditionally secure anonymous countable veto protocol, we proposed a measurement-device-independent quantum secure multiparty authenticated summation protocol. This protocol adopts perfect quantum encryption and one-time pad to achieve unconditional security. In addition, the protocol uses the weak coherent pulses of the BB84 state as the quantum resource, and only needs to perform Bell state identification to complete the calculation. Combined with the idea of grouping, it is applied to the quantum anonymous veto voting scenario, which ensures the anonymity of the protocol. Under the semi-honest model, the security of the designed protocol is proved. It can satisfy the correctness, security and relatively complete voting attributes. Finally, IBM Qiskit is used to carry out simulation experiments, and the experimental results verify the correctness and feasibility of the protocol.

Physica Scripta•Jul 21, 2023•3 citations
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.
Abstract To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.
Abstract Security and privacy have always been key concerns for individuals in various cloud-assisted services. In order to enhance security, we focus on quantum cryptography in novel cloud-based applications. First, we present two quantum primitive protocols to compute XOR of two private bits and AND of two private bits with the assistance of a quantum cloud, respectively. Then, we generalize two-party protocols to the corresponding multi-party cases. These quantum primitive protocols can ensure information-theoretical security and provide long-term security, which are guaranteed by the principles of quantum mechanics. Furthermore, we present a grouping strategy to improve the communication efficiency of multiparty quantum protocols. In addition, we investigate privacy-preserving applications of these quantum primitive protocols in cloud-based environments, e.g., cloud-based Anonymous Voting and Multiparty Private Set Intersection. Finally, simulated experiments show our proposed quantum protocols are correct and feasible with the present quantum technology.
Anonymity is a fundamental cryptographic primitive that hides the identities of both senders and receivers during message transmission over a network. Classical protocols cannot provide information-theoretic security for such task, and existing quantum approaches typically depend on classical subroutines and multiple private channels, thereby weakening their security in fully adversarial settings. In this work, we introduce the first fully quantum protocol for anonymous communication in realistic quantum networks with a device-independent security proof.
Security and privacy have always been key concerns for individuals in various edge-assisted services. In this paper, we present a feasible quantum solution to an important primitive of secure multiparty computations, i.e., Secure Multiparty Logical AND (SMLA), in which n participants can securely compute logical AND of n private bits. In order to ensure perfect security and achieve good feasibility, we introduce a semi-honest edge server and two non-collusive fog nodes, and design a secure and feasible edge-assisted quantum protocol for SMLA, which cleverly utilizes Secure Multiparty XOR to implement SMLA group by group. Furthermore, we focus on applications of this quantum primitive protocol and design two quantum protocols for Multiple Private Set Intersection and Anonymous One-vote Veto. Compared with classical related protocols, our proposed quantum protocols obtain higher security, which can be guaranteed by the basic principles of quantum mechanics.
Abstract Quantum mechanics offers new opportunities for diverse information processing tasks in communication and computational networks. In the last two decades, the notion of quantum anonymity has been introduced in several networking tasks that provide an unconditional secrecy of identity for the communicating parties. In this article, we propose a quantum anonymous collision detection (QACD) protocol which detects not only the collision but also guarantees the anonymity in the case of multiple senders. We show that the QACD protocol serves as an important primitive for a quantum anonymous network that features tracelessness and resource efficiency. Furthermore, the security analysis shows that this protocol is robust against the adversary and malicious participants.
Abstract In order to construct unconditionally secure anonymous countable veto protocol, we proposed a measurement-device-independent quantum secure multiparty authenticated summation protocol. This protocol adopts perfect quantum encryption and one-time pad to achieve unconditional security. In addition, the protocol uses the weak coherent pulses of the BB84 state as the quantum resource, and only needs to perform Bell state identification to complete the calculation. Combined with the idea of grouping, it is applied to the quantum anonymous veto voting scenario, which ensures the anonymity of the protocol. Under the semi-honest model, the security of the designed protocol is proved. It can satisfy the correctness, security and relatively complete voting attributes. Finally, IBM Qiskit is used to carry out simulation experiments, and the experimental results verify the correctness and feasibility of the protocol.