Secure Multiparty Quantum Computation for Summation and Multiplication

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.

[1]  D. J. Guan,et al.  A practical protocol for three-party authenticated quantum key distribution , 2014, Quantum Information Processing.

[2]  Mikhail J. Atallah,et al.  Private collaborative forecasting and benchmarking , 2004, WPES '04.

[3]  Dominique Unruh,et al.  Universally Composable Quantum Multi-party Computation , 2009, EUROCRYPT.

[4]  Avinatan Hassidim,et al.  Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[5]  Ahmed Farouk,et al.  A generalized architecture of quantum secure direct communication for N disjointed users with authentication , 2015, Scientific Reports.

[6]  Wen Qiao-Yan,et al.  Secure multiparty quantum summation , 2007 .

[7]  Peter Lory,et al.  Secure Distributed Multiplication of Two Polynomially Shared Values: Enhancing the Efficiency of the Protocol , 2009, 2009 Third International Conference on Emerging Security Information, Systems and Technologies.

[8]  Zijian Diao,et al.  Quantum Counting: Algorithm and Error Distribution , 2012 .

[9]  Roger Colbeck,et al.  The Impossibility Of Secure Two-Party Classical Computation , 2007, ArXiv.

[10]  Charles H. Bennett,et al.  WITHDRAWN: Quantum cryptography: Public key distribution and coin tossing , 2011 .

[11]  Ivan Damgård,et al.  Atomic Secure Multi-party Multiplication with Low Communication , 2007, EUROCRYPT.

[12]  Hoi-Kwong Lo,et al.  Insecurity of Quantum Secure Computations , 1996, ArXiv.

[13]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[14]  Masahide Abe.  Non-interactive and Optimally Resilient Distributed Multiplication , 2000 .

[15]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[16]  Adam D. Smith,et al.  Secure multi-party quantum computation , 2002, STOC '02.

[17]  Chris Clifton,et al.  Tools for privacy preserving distributed data mining , 2002, SKDD.

[18]  Qiaoyan Wen,et al.  An Efficient Protocol for the Secure Multi-party Quantum Summation , 2010 .

[19]  Xiaodong Lin,et al.  Privacy preserving regression modelling via distributed computation , 2004, KDD.

[20]  Harry Buhrman,et al.  Complete insecurity of quantum protocols for classical two-party computation Buhrman, , 2012 .

[21]  Run-hua Shi,et al.  Two Quantum Protocols for Oblivious Set-member Decision Problem , 2015, Scientific Reports.

[22]  Elad Eban,et al.  Interactive Proofs For Quantum Computations , 2017, 1704.04487.

[23]  Adam D. Smith,et al.  Authentication of quantum messages , 2001, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[24]  Chun-Wei Yang,et al.  Authenticated semi-quantum key distribution protocol using Bell states , 2014, Quantum Inf. Process..