A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
[chapter]
2015
Lecture Notes in Computer Science
In this paper we study the two fundamental functionalities oblivious polynomial evaluation in the exponent and set-intersection, and introduce a new technique for designing efficient secure protocols for these problems (and others). Our starting point is the [BGV11] technique (CRYPTO 2011) for verifiable delegation of polynomial evaluations, using algebraic PRFs. We use this tool, that is useful to achieve verifiability in the outsourced setting, in order to achieve privacy in the standard
doi:10.1007/978-3-662-46497-7_4
fatcat:qxra4n7m25hf7kkklepqsce3ua