A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Oblivious Polynomial Evaluation and Oblivious Neural Learning
[chapter]

2001
*
Lecture Notes in Computer Science
*

We study the problem of Oblivious Polynomial Evaluation (OPE). There are two parties, Alice who has a polynomial P , and Bob who has an input x. The goal is for Bob to compute P (x) in such way that Alice learns nothing about x and Bob learns only what can be inferred from P (x). Previously existing protocols are based on some intractability assumptions that have not been well studied [15, 14] , and these protocols are only applicable for polynomials over finite fields. In this paper, we

doi:10.1007/3-540-45682-1_22
fatcat:cfxijlfvtrhzhfpeqngcck7xfu