Distributed changing neighbors k-secure sum protocol for secure multiparty computation

摘要

Privacy preservation is an important area of the data mining because it allows the sharing of data between multiple parties. Various techniques are available to give privacy between multiple parties. In recent years, privacy preserving data mining has become more important because of the increasing ability to store personal data on the internet. In this paper, we discuss a novel protocol to compute the sum of an individual's data given by parties with zero leakage probability. We break the data blocks into segments and redistribute the segments among all the parties. After redistribution neighbors also changed their place. This is a scenario where it is impossible to know the private data of some other party.