A Distributed k-Secure Sum Protocol for Secure Multi-Party Computations

TL;DR

This paper introduces a novel distributed protocol for secure multi-party sum computation that ensures zero data leakage even if two neighboring parties collude, by segmenting and redistributing data segments among parties.

Contribution

It proposes a new protocol that enhances security in multi-party sum computations by preventing data leakage through data segmentation and redistribution.

Findings

Achieves zero probability of data leakage with colluding neighbors.

Ensures secure sum computation in distributed settings.

Prevents semi-honest parties from knowing private data.

Abstract

Secure sum computation of private data inputs is an interesting example of Secure Multiparty Computation (SMC) which has attracted many researchers to devise secure protocols with lower probability of data leakage. In this paper, we provide a novel protocol to compute the sum of individual data inputs with zero probability of data leakage when two neighbor parties collude to know the data of a middle party. We break the data block of each party into number of segments and redistribute the segments among parties before the computation. These entire steps create a scenario in which it becomes impossible for semi honest parties to know the private data of some other party.