4.7 Article

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

Journal

QUANTUM INFORMATION PROCESSING
Volume 20, Issue 7, Pages -

Publisher

SPRINGER
DOI: 10.1007/s11128-021-03183-0

Keywords

Secure multi-party summation; Blind matrix; Quantum Fourier transform

Funding

  1. National Natural Science Foundation of China (NSFC) [61701035, 61671085]

Ask authors/readers for more resources

The proposed protocol utilizes blind matrix method and quantum Fourier transform to achieve secure multi-party quantum summation and sorting, showing advantages of high security and efficiency.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available