Strong Privacy-preserving Two-party Scalar Product Quantum Protocol
Under the assumption that the parties do not change their private inputs during the whole protocol execution, we present a probabilistic quantum protocol for secure two-party scalar product without the help of any third party, which can ensure the security of the strong privacy of two parties. Especially, the communication complexity of this protocol achieves O(1), and thus it is more suitable for applications with big data.
KeywordsQuantum Cryptography Privacy-Preserving Multi-party Secure Computation Scalar Product
This work was supported by National Natural Science Foundation of China (No.61772001 and 61672010).
- 1.P. W. Shor. Algorithms for Quantum Computation – Discrete Logarithms and Factoring. Proceedings of 35th Annual Symposium on the Foundations of Computer Science (IEEE, New York, 1994), pp. 124-134.Google Scholar
- 2.L. K. Grover. A fast quantum mechanical algorithm for database search. Proceedings of 28th Annual ACM Symposium on Theory of Computing (ACM, New York, 1996), pp. 212-219.Google Scholar
- 3.C.H. Bennett & G. Brassard. Quantum Cryptography: Public Key Distribution and Coin Tossing. Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India (IEEE, New York, 1984), pp. 175-179.Google Scholar
- 12.Y. Wang, G. He. Quantum secure scalar product with continuous-variable clusters. Proceedings of the 18th AQIS Conference (8-12 September 2018, Nagoya, Japan). Available at http://www.ngc.is.ritsumei.ac.jp/~ger/static/AQIS18/OnlineBooklet/161.pdf (2018).
- 13.Shi, R.H., Mu, Y., Zhong, H., et al.: Secure Multiparty Quantum Computation for Summation and Multiplication. Sci. Rep.6(19655), (2016)Google Scholar
- 14.A. Majumder, S. Mohapatra, A. Kumar. Experimental Realization of Secure Multiparty Quantum Summation Using Five-Qubit IBM Quantum Computer on Cloud. arXiv:1707.07460v3 (2017).Google Scholar
- 16.G. Brassard, P. Høyer, and A. Tapp. Quantum Counting. Proceedings of 25th International Colloquium on Automata, Languages and Programming, LNCS 1443 (Springer-Verlag, Berlin Heidelberg, 1998), pp. 820-831.Google Scholar
- 19.A. Holevo. Probabilistic and Statistical Aspects of Quantum Theory. Publications of the Scuola Normale Superiore, Springer, 2011.Google Scholar