Abstract
In a rational protocol, players are supposed to be rational, rather than honest, semi-honest or dishonest. This kind of protocols is practical and important, but seldom researched in quantum computation field. In this paper, a multifunctional rational quantum secure multi-party computation protocol is investigated. Firstly, a rational quantum summation protocol is proposed. Secondly, the protocol is generalized to a rational quantum multi-party computation protocol. The computation which is homomorphic can be resolved by our protocol. Thirdly, from the view of utilities, correctness, Nash equilibrium and fairness, analyses show that our protocol is rational. Besides, our protocol is also proved to be secure, efficient and practical. Our research will promote the development of rational quantum multi-party protocol.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on IEEE SFCS’08, pp. 160–164. IEEE, Chicago (1982)
Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. ACM SIGKDD Explor. Newsl. 4, 28–34 (2002)
Sanil, A.P., Karr, A.F., Lin, X., Reiter, J.P.: Privacy preserving regression modelling via distributed computation. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 677–682. ACM, Seattle (2004)
Atallah, M., Bykova, M., Li, J., Frikken, K., Tophara, M.: Private collaborative forecasting and benchmarking. In: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, pp. 103–114. ACM, Washington (2004)
Li, P., Li, J., Huang, Z., Li, T., Gao, C.Z., Yiu, S.M., Chen, K.: Multi-key privacy-preserving deep learning in cloud computing. Future Gener. Comput. Syst. 74, 76–85 (2017)
Lo, H.K., Chau, H.F.: Unconditional security of quantum key distribution over arbitrarily long distances. Science 283, 2050–2056 (1999)
Mayers, D.: Unconditional security in quantum cryptography. ACM 48, 351–406 (2001)
Zhang, W.W., Li, D., Zhang, K.J., Zuo, H.J.: A quantum protocol for millionaire problem with Bell states. Quantum Inf. Process. 12, 2241–2249 (2013)
Luo, Q., Yang, G., She, K., Niu, W.N., Wang, Y.Q.: Multi-party quantum private comparison protocol based on d-dimensional entangled states. Quantum Inf. Process. 13, 2343–2352 (2014)
Du, J.Z., Chen, X.B., Wen, Q.Y., Zhu, F.C.: Secure multiparty quantum summation. Acta. Phys. 56, 6214–6219 (2007)
Chen, X.B., Xu, G., Yang, Y.X., Wen, Q.Y.: An efficient protocol for the secure multi-party quantum summation. Int. J. Theor. Phys. 49, 2793–2804 (2010)
Shi, R., Mu, Y., Zhong, H., Cui, J., Zhang, S.: Secure multiparty quantum computation for summation and multiplication. Sci. Rep-UK 6, 19655 (2016)
Halpern, J., Teague, V.: Rational secret sharing and multiparty computation. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 623–632 ACM, New York (2004)
Zhang, E., Yuan, P., Du, J.: Verifiable rational secret sharing scheme in mobile networks. Mob. Inf. Syst. 2015, 462345 (2015)
Wang, Y., Li, T., Qin, H., Li, J., Gao, W., Liu, Z., Xu, Q.: A brief survey on secure multi-party computing in the presence of rational parties. J. Ambent Intell. Humaniz. Comput. 6, 807–824 (2015)
Wang, Y.L., Li, T., Chen, L.F., Li, P., Leung, H.F., Liu, Z., Xu, Q.L.: Rational computing protocol based on fuzzy theory. Soft. Comput. 20, 429–438 (2016)
Maitra, A., De, S.J., Paul, G., Pal, A.K.: Proposal for quantum rational secret sharing. Phys. Rev. A 92, 022305 (2015)
Dou, Z., Xu, G., Chen, X.B., Liu, X., Yang, Y.X.: A secure rational quantum state sharing protocol. Sci. China. Inform. Sci. 61, 022501 (2018)
Li, X.H., Zhou, P., Li, C.Y., Zhou, H.Y., Deng, F.G.: Efficient symmetric multiparty quantum state sharing of an arbitrary m-qubit state. J. Phys. B-At. Mol. Opt. 39, 1975 (2006)
Xu, J., Wei, L., Zhang, Y., Wang, A., Zhou, F., Gao, C.Z.: Dynamic fully homomorphic encryption-based merkle tree for lightweight streaming authenticated data structures. J Netw. Comput. Appl. 107, 113–124 (2018)
Fudenberg D., Tirole J.: Game theory. The MIT press (1991)
Huang, W., Wen, Q.Y., Liu, B., Su, Q., Qin, S.J., Gao, F.: Quantum anonymous ranking. Phys. Rev. A 89, 032325 (2014)
Lin, S., Guo, G.D., Huang, F., Liu, X.F.: Quantum anonymous ranking based on the Chinese remainder theorem. Phys. Rev. A 93, 012318 (2016)
Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, pp. 175–179. IEEE, Bangalore (1984)
Gong, L.H., Song, H.C., He, C.S., Liu, Y., Zhou, N.R.: A continuous variable quantum deterministic key distribution based on two-mode squeezed states. Phys. Scr. 89, 035101 (2014)
Min, S.Q., Chen, H.Y., Gong, L.H.: Novel multi-party quantum key agreement protocol with G-like States and Bell States. Int. J. Theor. Phys. (2018). https://doi.org/10.1007/s10773-018-3706-6
Chen, X.B., Dou, Z., Xu, G., He, X.Y., Yang, Y.X.: A kind of universal quantum secret sharing protocol. Sci. Rep-UK 7, 39845 (2017)
Acknowledgements
Project supported by NSFC (Grant Nos. 61671087, 61272514, 61170272, 61003287), the Fok Ying Tong Education Foundation (Grant No. 131067), Open Foundation of Guizhou Provincial Key Laboratory of Public Big Data (2017BDKFJJ007) and BUPT Excellent Ph.D. Students Foundation (Grant No. CX2018310).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dou, Z., Xu, G., Chen, XB. et al. Rational protocol of quantum secure multi-party computation. Quantum Inf Process 17, 199 (2018). https://doi.org/10.1007/s11128-018-1967-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-018-1967-x