Quantum protocols for secure multi-party summation

Quantum secure multi-party summation is a kind of privacy-preserving summation whereby multiple mutually distrustful parties can securely compute the summation of their secret data, which can be utilized to execute many tasks of quantum secure multi-party computation, such as quantum anonymous surveying. In this paper, we present two quantum secure multi-party summation protocols, both of which allow multiple mutually distrustful parties to securely compute the summation of their secret data, where the dataset of the summation is supposed to be a set of nonnegative integers. Our protocols have two main common features. One is the assumption of a semi-honest third party who helps multiple parties to perform the summation computations and announces the results, at the same time he is allowed to misbehave on his own, but cannot conspire with any party. Another is the use of the entanglement swapping of d-level cat states and Bell states to maintain privacy, and pass information between each party and the semi-honest third party. We analyze the success probability of our two protocols, respectively. In addition, we generalize the use of our second protocol to execute the tasks of quantum anonymous ranking and quantum anonymous voting. What’s more, we show that our protocols can resist various attacks from both outside attackers and inside participants.