Efficient Collusion-Resisting Secure Sum Protocol

Secure sum protocol is a significant secure multiparty computation protocol and it has various applications in privacy-preserving distributed multiparty computation. However, most existing secure sum protocols rarely considered how to resist underlying collusion which is a significant practical problem. Urabe et al. proposed a collusion-resistant secure sum protocol, but too much cost of communication and computation results in its low performance efficiency. In this paper, we propose security definitions to measure secure multiparty computation protocol’s capability of resisting potential collusion. Then, we precisely analyze several previous secure sum protocols’ capability of resisting collusion. In addition, considering realistic requirement to resist collusion and performance efficiency needs, we present a novel collusion-resisting secure sum protocol. Theoretical analysis and experimental results confirm that our secure sum protocol is efficient and has strong capability of resisting potential collusion such that it is much superior to previous ones. The communication overheads and computation complexity of our scheme both are linearity of the number of participants. Besides, our protocol’s capability of resisting collusion is adjustable according to different security needs.