Multi-Party Quantum Summation Based on Quantum Teleportation

We present a secure multi-party quantum summation protocol based on quantum teleportation, in which a malicious, but non-collusive, third party (TP) helps compute the summation. In our protocol, TP is in charge of entanglement distribution and Bell states are shared between participants. Users encode the qubits in their hand according to their private bits and perform Bell-state measurements. After obtaining participants’ measurement results, TP can figure out the summation. The participants do not need to send their encoded states to others, and the protocol is therefore congenitally free from Trojan horse attacks. In addition, our protocol can be made secure against loss errors, because the entanglement distribution occurs only once at the beginning of our protocol. We show that our protocol is secure against attacks by the participants as well as the outsiders.

[1]  Mohsen Razavi,et al.  Repeat-until-success quantum repeaters , 2014, 1407.3362.

[2]  D. Matsukevich,et al.  Entanglement of single-atom quantum bits at a distance , 2007, Nature.

[3]  Guang Ping He.  Quantum private comparison protocol without a third party , 2016 .

[4]  Jeffrey H. Shapiro,et al.  Nonadiabatic approach to entanglement distribution over long distances , 2007 .

[5]  Fuguo Deng,et al.  Improving the security of multiparty quantum secret sharing against Trojan horse attack , 2005, quant-ph/0506194.

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

[7]  Nicole Yunger Halpern,et al.  Quantum voting and violation of Arrow's Impossibility Theorem , 2015, 1501.00458.

[8]  Leif Katsuo Oxenløwe,et al.  Space division multiplexing chip-to-chip quantum key distribution , 2017, Scientific Reports.

[9]  M. Razavi,et al.  Long-distance quantum key distribution with imperfect devices , 2012, 1210.8042.

[10]  P. C. Humphreys,et al.  Entanglement distillation between solid-state quantum network nodes , 2017, Science.

[11]  Qiaoyan Wen,et al.  Self-tallying quantum anonymous voting , 2016, 1605.07942.

[12]  Yuval Ishai,et al.  Secure Multiparty Computation with General Interaction Patterns , 2016, IACR Cryptol. ePrint Arch..

[13]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

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

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

[16]  Zhiwei Sun,et al.  Quantum private comparison with a malicious third party , 2015, Quantum Inf. Process..

[17]  Andrew Steane,et al.  Fast quantum logic gates with trapped-ion qubits , 2017, Nature.

[18]  Eran Omri,et al.  Optimizing Semi-Honest Secure Multiparty Computation for the Internet , 2016, IACR Cryptol. ePrint Arch..

[19]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[20]  Peng Xue,et al.  A simple quantum voting scheme with multi-qubit entanglement , 2017, Scientific Reports.

[21]  Mohsen Razavi,et al.  Quantum key distribution over probabilistic quantum repeaters , 2010 .

[22]  Adam Smith,et al.  Multi-party Quantum Computation , 2001 .

[23]  Yi Mu,et al.  Secure Multiparty Quantum Computation for Summation and Multiplication , 2016, Scientific Reports.

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

[25]  Naoya Wada,et al.  Wavelength division multiplexing of continuous variable quantum key distribution and 18.3 Tbit/s data channels , 2019, Communications Physics.

[26]  Zhi-Wei Sun,et al.  Three-party quantum summation without a trusted third party , 2015 .

[27]  H. F. Chau,et al.  Quantum-classical complexity-security tradeoff in secure multiparty computations , 1999, quant-ph/9901024.

[28]  Wen Liu,et al.  An Novel Protocol for the Quantum Secure Multi-Party Summation Based on Two-Particle Bell States , 2017 .

[29]  N. Gisin,et al.  Trojan-horse attacks on quantum-key-distribution systems (6 pages) , 2005, quant-ph/0507063.

[30]  Fuguo Deng,et al.  Improving the security of secure direct communication based on the secret transmitting order of particles , 2006, quant-ph/0612016.

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

[32]  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).

[33]  Erich Novak,et al.  On a problem in quantum summation , 2003, J. Complex..

[34]  Guihua Zeng,et al.  Quantum anonymous voting systems based on entangled state , 2008 .

[35]  Ivan Damgård,et al.  Better Preprocessing for Secure Multiparty Computation , 2016, ACNS.

[36]  V. Buzek,et al.  Towards quantum-based privacy and voting , 2005, quant-ph/0505041.

[37]  Tzonelih Hwang,et al.  Multiparty quantum private comparison with almost dishonest third parties for strangers , 2017, Quantum Inf. Process..

[38]  Shun Zhang,et al.  Quantum solution to a class of two-party private summation problems , 2017, Quantum Information Processing.

[39]  Marcel Keller,et al.  Efficient Maliciously Secure Multiparty Computation for RAM , 2018, IACR Cryptol. ePrint Arch..

[40]  Nicolas Gisin,et al.  Quantum repeaters based on atomic ensembles and linear optics , 2009, 0906.2699.

[41]  Stefan Heinrich.  Quantum Summation with an Application to Integration , 2002, J. Complex..

[42]  Qiong Huang,et al.  Multi-party quantum summation without a trusted third party based on single particles , 2017 .

[43]  Tian-Yu Ye,et al.  Secure multi-party quantum summation based on quantum Fourier transform , 2018, Quantum Information Processing.

[44]  Henryk Wozniakowski,et al.  Quantum Boolean Summation with Repetitions in the Worst-Average Setting , 2004 .

[45]  Dongyang Long,et al.  High-Capacity Quantum Summation with Single Photons in Both Polarization and Spatial-Mode Degrees of Freedom , 2014 .