Multi-party quantum summation without a trusted third party based on single particles

Abstract

We propose multi-party quantum summation protocols based on single particles, in which participants are allowed to compute the summation of their inputs without the help of a trusted third party and preserve the privacy of their inputs. Only one participant who generates the source particles needs to perform unitary operations and only single particles are needed in the beginning of the protocols.

An efficient simulation for quantum secure multiparty computation

“…The protocol 48 is multiparty and its type of computation is secret-by-secret, but it is based on the threshold approach of ( n , n ). The protocols 49 , 50 perform bit-by-bit computation, but they are based on the threshold approach of ( n , n ). The protocol 51 is multiparty, but its type of computation is bit-by-bit and it has the threshold approach of ( n , n ) with modulo is 2.…”

“…Shi and Zhang 49 discussed a QSMS protocol, which can compute the summation efficiently, but it is not secure because it has only two-party. Zhang et al 50 implemented a QSMS protocol based on quantum secure multiparty computation, but its modulo is 2 only. Liu et al 51 discussed a QSMS protocol based on the threshold approach of ( n , n ) with modulo 2, and its form of computation is bit-by-bit.…”

Multi-Party Quantum Summation Based on Quantum Teleportation

“…Later, they proposed a common quantum solution to a class of two-party private summation problems [ 28 ]. In 2017, a multi-party quantum summation without a trusted third party was investigated by first generating a multipartite entangled state by one player and then sharing it with other users [ 29 ]. In the same year, Liu et al [ 30 ] adopted Bell states to construct multipartite entangled states that were used to carry participants’ inputs, where the quantum communication in their protocol is two-way.…”

“…One common feature in all hitherto proposed quantum summation protocols is their dependence on a reliable means for quantum state transfer. In the case of protocols that rely on sharing multipartite entangled states [ 27 , 28 , 29 , 30 , 34 ], such a state is often generated by one player and then its different components are sent to other players. If any of these components does not reach its respective destination, then the whole procedure must be repeated.…”

Quantum secure multiparty summation based on the mutually unbiased bases of <italic>d</italic>-level quantum systems and its application

“…这个量子求和协议的特点是适用于N级 量子系统, 采用比特加比特的计算方式以实现普通加 法求和, 这里N是每个秘密持有者秘密的长度. 同年, Zhang等人 [11] 利用单光子设计一个量子多方模2求和…”