Quantum secure multi-party computational geometry based on multi-party summation and multiplication

• Published in: Quantum science and technology Vol. 9; no. 2; pp. 25023 - 25037
• Main Authors: Dou, Zhao, Wang, Yifei, Liu, Zhaoqian, Bi, Jingguo, Chen, Xiubo, Li, Lixiang
• Format: Journal Article
• Language: English
• Published: IOP Publishing 01.04.2024
• Subjects: accuracy; multi-TP; quantum multi-party summation and multiplication; quantum secure multi-party computational geometry
• ISSN: 2058-9565; 2058-9565
• DOI: 10.1088/2058-9565/ad34f5

Abstract Secure multi-party computational geometry is a branch of secure multi-party computation, which is applied in many important fields. But up to now, the research on how to solve this problem with quantum methods has just started. Therefore, we study the design of quantum secure multi-party computational geometry (QSMCG) protocols in this paper. As the foundation, we extend the two-party summation and multiplication protocols proposed by Sutradhar and Om to multi-party protocols. Then we propose three new QSMCG protocols. Our proposed quantum secure two-party distance computation protocol has improvement in efficiency and accuracy. And the proposed quantum secure multi-party polytope volume computation protocol as well as the quantum secure circle–circle intersection area computation protocol are designed for the first time. Moreover, these protocols are designed to use multi-third parties, which solves the problem of intermediate value leakage in computation. The correctness, security and performance of all these protocols are analyzed.