Binary Information Press
Secure Multi-party Computation (SMC) problems deal with the following situation: two or more parties want to jointly perform a computation. Each needs to contribute its private input to the computation, but neither should disclose its private inputs to the others, or to any third party. Secure polynomial computation is a type of specific secure multi-party computation problems; it has received wide applications in secure protocols and secure scientific computations. In this paper, the authors give some efficient secure protocols on polynomial computations, including oblivious polynomial evaluation, private polynomial interpolation, and the inversion of polynomial. The security of these protocols is proven by simulation paradigm in the semi-honest model.