Abstract

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.

Highlights

  • On the one hand, there existed some classical protocols for Secure Multiparty Summation[2,3,4] and Multiplication[5,6,7], which were based on classical cryptography

  • In 2010, Chen et al.[16] proposed another secure quantum addition module 2 based on multi-particle entangled states with the trusted third party

  • We present a novel quantum approach to systematically and efficiently compute Secure Multiparty Summation and Multiplication, in which the computations of Secure Multiparty Summation and Multiplication are securely translated into the computations of the corresponding phase information by the quantum Fourier transform, and later the phase information is extracted out after performing an inverse quantum Fourier transform

Read more

Summary

OPEN Secure Multiparty Quantum

Computation for Summation and Multiplication received: 25 September 2015 accepted: 08 December 2015. There is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. We present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. There existed some classical protocols for Secure Multiparty Summation[2,3,4] and Multiplication[5,6,7], which were based on classical cryptography. Another multi-qubit quantum logic gate, which will be used later in proposed protocols, is the controlled-NOT or CNOT gate: 00 → 00 , 01 → 01 , 10 → 11 and 11 → 10 , where the first qubit is the control qubit, and the second qubit is the target qubit. If the control qubit is set to 1, the target qubit is flipped

Results
After applying the oracle operator
Discussion
Additional Information
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call