Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation

TL;DR

This paper introduces a novel secure sum protocol for multi-party computation that enhances privacy by dynamically changing neighbors and segmenting inputs, preventing data leakage even from semi-honest parties.

Contribution

The paper proposes a new protocol that improves privacy in secure sum computation by altering neighbor arrangements and segmenting inputs to prevent data leakage.

Findings

Protocol ensures zero probability of data leakage.

Changing neighbors complicates semi-honest parties' ability to infer private data.

The method enhances privacy without compromising computational correctness.

Abstract

Secure sum computation of private data inputs is an important component of Secure Multi party Computation (SMC).In this paper we provide a protocol to compute the sum of individual data inputs with zero probability of data leakage. In our proposed protocol we break input of each party into number of segments and change the arrangement of the parties such that in each round of the computation the neighbors are changed. In this protocol it becomes impossible for semi honest parties to know the private data of some other party.