Secure Multiparty Quantum Computation for Summation and Multiplication
Authors:
Open Access
- 21 January 2016
- journal article
- research article
- Published by Springer Nature in Scientific Reports
- Vol. 6 (1) , 19655
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.Keywords
This publication has 19 references indexed in Scilit:
- A practical protocol for three-party authenticated quantum key distributionQuantum Information Processing, 2014
- Authenticated semi-quantum key distribution protocol using Bell statesQuantum Information Processing, 2014
- Complete Insecurity of Quantum Protocols for Classical Two-Party ComputationPhysical Review Letters, 2012
- Quantum Counting: Algorithm and Error DistributionActa Applicandae Mathematicae, 2012
- An Efficient Protocol for the Secure Multi-party Quantum SummationInternational Journal of Theoretical Physics, 2010
- Universally Composable Quantum Multi-party Computation2010
- Impossibility of secure two-party classical computationPhysical Review A, 2007
- Atomic Secure Multi-party Multiplication with Low CommunicationLecture Notes in Computer Science, 2007
- Tools for privacy preserving distributed data miningACM SIGKDD Explorations Newsletter, 2002
- Insecurity of quantum secure computationsPhysical Review A, 1997