Sciweavers

CRYPTO
2010
Springer

Improved Delegation of Computation Using Fully Homomorphic Encryption

14 years 27 days ago
Improved Delegation of Computation Using Fully Homomorphic Encryption
Following Gennaro, Gentry, and Parno (Cryptology ePrint Archive 2009/547), we use fully homomorphic encryption to design improved schemes for delegating computation. In such schemes, a delegator outsources the computation of a function F on many, dynamically chosen inputs xi to a worker in such a way that it is infeasible for the worker to make the delegator accept a result other than F(xi). The "online stage" of the Gennaro et al. scheme is very efficient: the parties exchange two messages, the delegator runs in time poly(log T), and the worker runs in time poly(T), where T is the time complexity of F. However, the "offline stage" (which depends on the function F but not the inputs to be delegated) is inefficient: the delegator runs in time poly(T) and generates a public key of length poly(T) that needs to be accessed by the worker during the online stage. Our first construction eliminates the large public key from the Gennaro et al. scheme. The delegator still in...
Kai-Min Chung, Yael Kalai, Salil P. Vadhan
Added 08 Nov 2010
Updated 08 Nov 2010
Type Conference
Year 2010
Where CRYPTO
Authors Kai-Min Chung, Yael Kalai, Salil P. Vadhan
Comments (0)