Improvements on “Secure multi-party quantum summation based on quantum Fourier transform”
- 28 Downloads
Recently, a quantum multi-party summation protocol based on the quantum Fourier transform has been proposed (Yang et al. in Quantum Inf Process 17:129, 2018). The protocol claims to be secure against both outside and participant attacks. However, a closer look reveals that the player in charge of generating the required multi-partite entangled states can launch two kinds of attacks to learn about other parties’ private integer strings without being caught. In this paper, we present these attacks and propose countermeasures to make the protocol secure again. The improved protocol not only can resist these attacks but also remove the need for the quantum Fourier transform and encoding quantum operations by participants.
KeywordsQuantum summation Quantum Fourier transform Participant attacks
This work is supported by the National Natural Science Foundation of China (Grant Nos. 61902132, 11647140, 61602316, 61502179, 61472452, 61202398), the Natural Science Foundation of Guangdong Province of China (Grant Nos. 2018A030310147, 2014A030310265), and the Science and Technology Innovation Projects of Shenzhen (No. JCYJ20170818140234295). Mohsen Razavi acknowledges the support of UK EPSRC Grant EP/M013472/1. Cai Zhang is sponsored by the State Scholarship Fund of the China Scholarship Council. All data generated in this paper can be reproduced by the provided methodology.
- 1.Bennett, C.H., Brassard, G.: Quantum cryptography: public-key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, pp. 175–179. IEEE Press, Bangalore (1984)Google Scholar
- 5.Crépeau, C., Gottesman, D., Smith, A.: Secure multi-party quantum computation. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 643–652 (2002)Google Scholar
- 7.Ben-Or, M., Crépeau, C., Gottesman, D., Hassidim, A. Smith, A.: Secure multiparty quantum computation with (only) a strict honest majority. In: 47th Annual IEEE Symposium on Foundations of Computer Science, 2006. FOCS’06, pp. 249–260 (2006)Google Scholar
- 8.Smith, A.: Multi-party Quantum Computation (2010). arXiv:quant-ph/0111030
- 15.Heinrich, S., Kwas, M., Woźniakowski, H.: Quantum Boolean summation with repetitions in the worst-average setting. In: Niederreiter, H. (ed.) Monte Carlo and Quasi-Monte Carlo Methods, pp. 243–258. Springer, Heidelberg (2004)Google Scholar
- 31.Gu, J., Hwang, T.: Improvement on “Secure multi-party quantum summation based on quantum Fourier transform” (2019). arXiv:1907.02656