Authors
Dario Fiore, Rosario Gennaro, Valerio Pastro
Publication date
2014/11/3
Book
Proceedings of the 2014 ACM SIGSAC conference on computer and communications security
Pages
844-855
Description
We study the task of verifiable delegation of computation on encrypted data. We improve previous definitions in order to tolerate adversaries that learn whether or not clients accept the result of a delegated computation. In this strong model, we construct a scheme for arbitrary computations and highly efficient schemes for delegation of various classes of functions, such as linear combinations, high-degree univariate polynomials, and multivariate quadratic polynomials. Notably, the latter class includes many useful statistics. Using our solution, a client can store a large encrypted dataset on a server, query statistics over this data, and receive encrypted results that can be efficiently verified and decrypted.
As a key contribution for the efficiency of our schemes, we develop a novel homomorphic hashing technique that allows us to efficiently authenticate computations, at the same cost as if the data were in the clear, avoiding …
Scholar articles
D Fiore, R Gennaro, V Pastro - Proceedings of the 2014 ACM SIGSAC conference on …, 2014
R Gennaro, V Pastro - IACR Cryptol. ePrint Arch., 2014