Secure multi-party quantum summation based on quantum Fourier transform
Hui-Yi Yang, Tian-Yu Ye

TL;DR
This paper introduces a secure multi-party quantum summation protocol utilizing quantum Fourier transform, ensuring privacy and resistance to various attacks, suitable for quantum networks with multiple participants.
Contribution
It presents a novel quantum summation protocol based on quantum Fourier transform that enhances security and efficiency in multi-party quantum computations.
Findings
Resists outside and participant attacks
Prevents parties from learning others' private data
Secure against collusion of up to n-2 parties
Abstract
In this paper, we propose a novel secure multi-party quantum summation protocol based on quantum Fourier transform, where the traveling particles are transmitted in a tree-type mode. The party who prepares the initial quantum states is assumed to be semi-honest, which means that she may misbehave on her own but will not conspire with anyone. The proposed protocol can resist both the outside attacks and the participant attacks. Especially, one party cannot obtain other parties' private integer strings; and it is secure for the colluding attack performed by at most n-2 parties, where n is the number of parties. In addition, the proposed protocol calculates the addition of modulo d and implements the calculation of addition in a secret-by-secret way rather than a bit-by-bit way.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
