Secure multiparty computation using secret sharing
Kinjal N. Patel · 2016
Far reaching a fast increment in number of information and the development of correspondence innovations host empowered community calculations among multi parties. Saving protection of information claimed by gatherings is getting to be pivotal step by step. So security is the fundamental issue in secure multiparty computation. For secure multiparty computation mainly three methodologies are there: Oblivious Transfer, Homomorphic Encryption, and Secret Sharing. Among these three, secret sharing is better in terms of efficiency. Secret sharing is a method to safely share data between numerous gatherings. Secret is isolated into pieces, distribute among gatherings, and recuperated by the approved arrangement of gatherings. Secure multiparty can be executed in two ways: Centralized and Distributed. In a centralized way, risk of single point failure. That is, if central party is misbehaving then client's privacy cannot be kept up. Also, communication and computational cost is high. So, in this paper we proposed a new method in which secure multiparty is executed in a distributed environment and utilizing group mechanism between parties to preserve the user's privacy and this methodology will diminish the communication and computation cost.