Verifiable Delegation of Computation over Large Datasets


We study the problem of computing on large datasets that are stored on an untrusted server. We follow the approach of amortized verifiable computation introduced by Gennaro, Gentry, and Parno in CRYPTO 2010. We present the first practical verifiable computation scheme for high degree polynomial functions. Such functions can be used, for example, to make… (More)
DOI: 10.1007/978-3-642-22792-9_7
View Slides


1 Figure or Table


Citations per Year

244 Citations

Semantic Scholar estimates that this publication has 244 citations based on the available data.

See our FAQ for additional information.