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.
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.
Abstract In this paper, we consider an interesting and important privacy-preserving issue, i.e., how to implement anonymous and secure communications for several intelligence agents, hiding in n participants. To solve this issue, we first propose a quantum Secure Multiparty Computing XOR (SMC_XOR) protocol based on single photons, which can guarantee the unconditional security of the protocol. By implementing rotation encryption, the practicality of quantum SMC_XOR protocol can be significantly improved without other complex quantum techniques. Security analysis shows that the proposed protocol can resist various types of attacks. Furthermore, a special network model is designed to solve this issue, using hash function to verify the identity of the communication parties and key recycling to reduce resource consumption. Finally, the proposed quantum SMC_XOR protocol is simulated in IBM Qiskit, and the simulation results show that the protocol is correct and feasible.
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.
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.
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.
In this article, we first define a primitive problem of secure multiparty computations, i.e., secure multiparty disjunction (SMD), and present a novel quantum protocol for SMD that can ensure information-theoretical security, i.e., unconditional security. Furthermore, based on the quantum SMD protocol, we design a quantum sealed-bid auction (QSA) scheme without an auctioneer. In the proposed QSA scheme, all bidders can jointly find the winning bidder without the help of an auctioneer while it can perfectly protect the privacy of nonwinning bidders. The proposed quantum SMD protocol and quantum QSA scheme take Bell states as quantum resources and only perform single-particle Pauli operators and two-particle Bell measurements. Finally, we simulate the related quantum protocols in Qiskit and verify the correctness and the feasibility of the proposed protocols.
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.