Title: Cryptographic collusion-resistant protocols for secure sum

Authors: Maede Ashouri-Talouki; Ahmad Baraani-Dastjerdi

Addresses: Department of IT Engineering, Faculty of Computer Engineering, University of Isfahan, Isfahan, Iran ' Department of Software Engineering, Faculty of Computer Engineering, University of Isfahan, Isfahan, Iran

Abstract: Secure summation is one of the most applicable functions of secure multiparty computation (MPC) in which a group of users securely computes the summation value of their private inputs. The current solutions to this problem are basically on adding a random number to private inputs or splitting the inputs among users which need secure channel among members. Moreover, to be resistant against collusion of n − 2 players, they impose high communication cost. In this paper, we propose three cryptography-based protocols for secure sum that do not need secure channel and are secure against collusion of n − 2 players. Also, the communication cost of the proposed protocols is of complexity O(n). Based on the privacy requirements, the proposed protocols can provide the final result privacy as well as the private input privacy.

Keywords: multiparty computation; secure MPC; cryptography; data privacy; collusion resistance; collusion-resistant protocols; secure summation; data security; privacy preservation; privacy protection; secure sum.

DOI: 10.1504/IJESDF.2017.081753

International Journal of Electronic Security and Digital Forensics, 2017 Vol.9 No.1, pp.19 - 34

Received: 12 Apr 2016
Accepted: 29 Jul 2016
Published online: 24 Jan 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article