Lu Yaohua, Ding Gangyi
School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China.
Entropy (Basel). 2024 Jan 17;26(1):80. doi: 10.3390/e26010080.
Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems.
量子安全多方求和（QSMS）是量子安全多方计算（QSMC）中的一个基本问题，其中多个参与方在不泄露其数据的情况下计算它们数据的总和。本文提出了一种基于图态的新型QSMS协议，与现有方法相比，该协议具有更高的安全性、可用性和灵活性。该协议利用图态的结构优势，采用随机图态结构和随机加密门操作来提供更强的安全性。此外，利用图态的稳定子来检测窃听者和信道噪声，而无需使用诱饵比特。该协议允许任意添加和删除参与者，具有更大的灵活性。进行了实验验证，以证明所提出协议的安全性、有效性和实用性。正式证明了协议的正确性和安全性。基于图态的QSMS方法为QSMC带来了新的机遇。它突出了利用量子图态技术安全、高效地解决各种多方计算问题的潜力。
