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

iScience

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

Runhua Shi, Xia-qin Fang

Published May 29, 2023• 7 citations
Publisher

Abstract

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.

DOI
10.1016/j.isci.2023.106990

Related papers

Quantum Protocol for Secure Multiparty Logical AND With Application to Multiparty Private Set Intersection Cardinality

Runhua Shi, Yi-Fei Li

Like addition, subtraction, multiplication and division, logical AND is a fundamental arithmetic operation in scientific computing. In this paper, we first consider and define a new privacy-preserving problem, i.e., Secure Multiparty Logical AND (SMLA), in which multiple participants can jointly compute the logical AND of their respective private bits. Furthermore, we present a novel quantum SMLA protocol by employing phase-matching quantum conference key agreement and perfect quantum encryption, and design the corresponding quantum circuits. The proposed quantum SMLA protocol can ensure information-theoretical security. What’s more, we design a private grouping strategy to reduce the communicational complexity and accordingly present an improved quantum SMLA protocol with the linear communicational rounds. In addition, we investigate its applications and design a feasible quantum Multiparty Private Set Intersection Cardinality (MPSI-CA) protocol based on the improved quantum SMLA protocol, in which multiple participants jointly compute the intersection cardinality without revealing their respective private sets. Finally, we verify the correctness and the feasibility of the proposed quantum protocols by circuit simulations in IBM Qiskit.

IEEE Transactions on Circuits and Systems I Regular Papers•Aug 29, 2022•21 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

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

Quantum protocol for secure multiparty XOR with application to secure communication in metropolitan area networks

HuiJie LI, Run-Hua SHI, Weiyang Ke +1 more

This study first defined a new privacy protection problem, namely, quantum secure multiparty logical XOR (SMC_ XOR), and then designed corresponding quantum circuits where multiple participants could jointly calculate the logical XOR of their respective private bits. The proposed quantum SMC_XOR protocol can ensure unconditional security, i.e., information-theoretical security. Furthermore, we designed a grouping strategy to reduce communication complexity and presented an improved quantum SMC_XOR protocol. The improved quantum protocol is used to secure communication in metropolitan area networks, allowing two remote users to securely transmit confidential messages. Finally, we verified the correctness and feasibility of the proposed quantum SMC_XOR protocol by conducting circuit simulations on the IBM quantum system in Qiskit.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Sep 1, 2023•2 citations

Privacy-preserving quantum protocol for finding the maximum value

Runhua Shi, Yifei Li

Abstract In this paper, we first define a primitive protocol of secure multiparty computations to privately compute the logic operator “OR” (SMC_OR). Accordingly, we design a feasible quantum SMC_OR protocol by using single photons, which can achieve information-theoretical security in the semi-honest model. Furthermore, we adopt the proposed quantum SMC_OR protocol to solve an interesting but important privacy-preserving problem, i.e., finding the maximum value among many secrets. Finally, we simulate the related quantum protocols in Qiskit and verify the correctness and the feasibility of the proposed protocols.

EPJ Quantum Technology•May 12, 2022•22 citations

Secure Multiparty Quantum Computation for Summation and Multiplication

Runhua Shi, Yi Mu, Hong Zhong +2 more

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.

Scientific Reports•Jan 21, 2016•111 citations
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.
Like addition, subtraction, multiplication and division, logical AND is a fundamental arithmetic operation in scientific computing. In this paper, we first consider and define a new privacy-preserving problem, i.e., Secure Multiparty Logical AND (SMLA), in which multiple participants can jointly compute the logical AND of their respective private bits. Furthermore, we present a novel quantum SMLA protocol by employing phase-matching quantum conference key agreement and perfect quantum encryption, and design the corresponding quantum circuits. The proposed quantum SMLA protocol can ensure information-theoretical security. What’s more, we design a private grouping strategy to reduce the communicational complexity and accordingly present an improved quantum SMLA protocol with the linear communicational rounds. In addition, we investigate its applications and design a feasible quantum Multiparty Private Set Intersection Cardinality (MPSI-CA) protocol based on the improved quantum SMLA protocol, in which multiple participants jointly compute the intersection cardinality without revealing their respective private sets. Finally, we verify the correctness and the feasibility of the proposed quantum protocols by circuit simulations in IBM Qiskit.
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.
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.
This study first defined a new privacy protection problem, namely, quantum secure multiparty logical XOR (SMC_ XOR), and then designed corresponding quantum circuits where multiple participants could jointly calculate the logical XOR of their respective private bits. The proposed quantum SMC_XOR protocol can ensure unconditional security, i.e., information-theoretical security. Furthermore, we designed a grouping strategy to reduce communication complexity and presented an improved quantum SMC_XOR protocol. The improved quantum protocol is used to secure communication in metropolitan area networks, allowing two remote users to securely transmit confidential messages. Finally, we verified the correctness and feasibility of the proposed quantum SMC_XOR protocol by conducting circuit simulations on the IBM quantum system in Qiskit.
Abstract In this paper, we first define a primitive protocol of secure multiparty computations to privately compute the logic operator “OR” (SMC_OR). Accordingly, we design a feasible quantum SMC_OR protocol by using single photons, which can achieve information-theoretical security in the semi-honest model. Furthermore, we adopt the proposed quantum SMC_OR protocol to solve an interesting but important privacy-preserving problem, i.e., finding the maximum value among many secrets. Finally, we simulate the related quantum protocols in Qiskit and verify the correctness and the feasibility of the proposed protocols.
As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.