Mert Özarar
Department of Computer Engineering, Middle East Technical University
Special Presentation
Secure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation
The number of opportunities for cooperative computation has exponentially been increasing with growing interaction via Internet technologies. Most of the time, the communicating parties may not want to disclose their private data to the other principal while taking the advantage of collaboration, hence concentrating on the results rather 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 reserving overall mean computation problem is analyzed. We present two protocols for two-party and multi-party case via oblivious polynomial evaluation is used as a cryptographic mechanism to assure the security of the private data. Under given security assumptions, the privacy validity of the algorithms are justified.