| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952450 | Theoretical Computer Science | 2016 | 39 Pages |
Abstract
As a case study, we take a closer look at the oblivious polynomial evaluation (OPE) protocol of Hazay and Lindell, show that it is commit-first, and instantiate efficient rate-limited variants of it.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ãzgür Dagdelen, Payman Mohassel, Daniele Venturi,