3 search results - page 1 / 1 » Fully Homomorphic Encryption with Polylog Overhead |
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Following Gennaro, Gentry, and Parno (Cryptology ePrint Archive 2009/547), we use fully homomorphic encryption to design improved schemes for delegating computation. In such schem...
CRYPTO
2011
Springer
12 years 4 months ago
2011
Springer
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...