Secure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation

The number of opportunities for cooperative comput ation has exponentially been increasing with growing interact ion via Internet technologies. Most of the time, the communicating p arties may not want to disclose their private data to the other principal while taking the advantage of collaboration, hence concentrating on the results r ather than private and perhaps useless data values. To conduct such a computation while preserving the privacy of the inputs for a target case is referred to as Secure Multiparty Computation problem. In this work, the privacy pres erving overall mean computation problem is analyzed. We present two pro tocols for two-party and multi-party case via oblivious polynomial evaluatio n is used as a cryptographic mechanism to assure the security of the private dat a. Under given security assumptions, the privacy validity of the algorithms are justified.