Daniel Berend

A method for performing , in a single round of communication and by a distributed computational system , Secure MultiParty Computation (SMPC ) of an arithmetic function ƒ : F * > F , represented as a multivariate polynomial over secret shares for a user , comprising the steps of sharing secrets among participants being distributed computerized systems , using multiplicative shares , the product of which is the secret , or additive shares , that sum up to the secret by partitioning secrets to sums or products of random elements of the field ; implementing sequences of additions of secrets locally by addition of local shares or sequences of multipli cations of secrets locally by multiplication of local shares ; separately evaluating the monomials of ƒ by the participants ;adding the monomials to obtain secret shares of ƒ