The tremendous development of cloud computing and network technology makes it possible for multiple people with limited resources to complete a large-scale computing with the help of cloud servers. In order to protect the privacy of clients, secure multiparty computation plays an important role in the process of computing. Recently, Clementi et al[\textcolor[rgb]{0.00,0.07,1.00}{Phys. Rev. A {\bf 96}, 062317(2017)}] proposed a secure multiparty computation protocol using quantum resources. In their protocol, utilizing only linear classical computing and limited manipulation of quantum information, a method of computing
n−variable symmetric Boolean function
f(x1,x2,⋯,xn) with degree 2 is proposed, and all clients can jointly compute
f(x1,x2,⋯,xn) without revealing their private inputs with the help of a sever. They proposed an open problem: are there more simple nonlinear functions like the one presented by them that can be used as subroutines for larger computation protocols? We will give the answer to this question in this paper. Inspired by Clementi et al's work, we continue to explore the quantum realization of Boolean functions. First, we demonstrate a way to compute a class of
n−variable symmetric Boolean function
fnk by using single-particle quantum state
∣0⟩ and single-particle unitary operations
Uk. Second, we show that each
n−variable symmetric Boolean function can be represented by the linear combination of
fnk(k=0,1,⋯,n) and each function
fnk(2≤k≤n) can be used to perform secure multiparty computation. Third, we propose an universal quantum implementation method for arbitrary
n−variable symmetric Boolean function
f(x1,x2,⋯,xn). Finally, we demonstrate our secure multiparty computation protocol on IBM quantum cloud platform.
Abstract Secure multiparty computation (SMC) provides collaboration among multiple parties, ensuring the confidentiality of their private information. However, classical SMC implementations encounter significant security and efficiency challenges. Resorting to the entangled Greenberger–Horne–Zeilinger (GHZ) state, we propose a quantum-based two-party protocol to compute binary Boolean functions, with the help of a third party. We exploit a technique in which a random Z-phase rotation on the GHZ state is performed to achieve higher security. The security and complexity analyses demonstrate the feasibility and improved security of our scheme compared to other SMC Boolean function computation methods. Additionally, we implemented the proposed protocol on the IBM QisKit and found consistent outcomes that validate the protocol’s correctness.
The secure multiparty quantum summation is an important primitive of quantum cryptography. The existing multiparty quantum summation protocols have (n, n) threshold approach, where n out of total n players need compute the summation protocol. In this brief, we present a generalized secure multiparty quantum summation protocol. In our protocol, the linear secret sharing (LSS) and Quantum Fourier Transform (QFT) are used to take the advantages of both classical and quantum summation. We show that the outside and participant attacks are not possible in our protocol. We simulate it using the real quantum processor released by IBM corporation on “cloud”.
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.
A scheme for secure multiparty quantum summation was proposed by Run-hau Shi et al.,(SCIENTIFIC REPORTS, 6:19655, DOI:10.1038/srep19655). IBM Corporation has released a superconductivity based 5-qubit quantum computer named "Quantum Experience" and placed it on "cloud". In this paper we take advantage of the online availability of this real quantum processor(ibmqx2) and carry out the above protocol that has never been experimentally demonstrated earlier. Here, we set up experiments for secure quantum summation of one-qubit secret states . Besides, we propose a protocol for square and cubic summation and also simulate the proposed protocol for both cases. Experimental implementation of secure multiparty quantum summation protocol for two or more qubit secret state and the proposed protocol for square(and cubic) summation are not possible using the available 5-qubit quantum processor(ibmqx2). IBM has recently placed a 16-qubit quantum processor(ibmqx3) on the cloud but it is still not accessible for all users. We describe a simulation for two and three qubit secret state and proposed protocol for square(and cubic) summation using a simulator(Custom Topology) which is provided by IBM Corporation.
The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation's online quantum computer, or quantum experience.