Quantum Secure Multi-Party Summation Based on Grover’s Search Algorithm

In this paper, a quantum secure multi-party summation protocol is proposed based on some properties of Grover’s search algorithm. In the protocol, each participant’s secret input is encoded as a unitary operation on the travelling two-qubit state. With the help of a semi-honest third party, all participants can simultaneously obtain the summation result without disclosing their secret inputs. Only the preparation and measurement of single qubits are required, which makes the proposed protocol feasible using current technology. At last, we demonstrate the correctness and security of the protocol, which can resist various attacks from both external attackers and internal participants.