Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform

• Published in: Quantum information processing Vol. 20; no. 7
• Main Authors: Yi, Xin, Cao, Cong, Fan, Ling, Zhang, Ru
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.07.2021; Springer Nature B.V
• Subjects: Client server systems; Data Structures and Information Theory; Fourier transforms; Mathematical Physics; Network topologies; Physics; Physics and Astronomy; Quantum Computing; Quantum Information Technology; Quantum Physics; Spintronics; Task complexity; Quantum Fourier transform; Blind matrix; Secure multi-party summation
• ISSN: 1570-0755; 1573-1332
• DOI: 10.1007/s11128-021-03183-0

Multi-party quantum summation is the premise for implementing other complex multi-party quantum computing tasks. Here, a hybrid protocol is proposed to simultaneously implement secure multi-party quantum summation and sorting, which consists of one server and n clients. The proposed protocol is based on the blind matrix method and quantum Fourier transform, which possesses secret-by-secret computation type and star network topology structure between the server and clients. It can resist multiple attack modes including intercept-measurement attack, intercept-resend attack, entangle-measurement attack, collusion attack, server attack, collective attack, and coherent attack. In the process of implementing the protocol, the client only needs to perform simple quantum operations, which is considerably different from previous protocols. Therefore, the protocol has advantages of high security, high efficiency, broad application scenarios, and good practicability.