Sciweavers

2601 search results - page 521 / 521
» Secure Rewarding Schemes
Sort
View
EUROCRYPT
2012
Springer
12 years 12 months ago
Fully Homomorphic Encryption with Polylog Overhead
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...
Craig Gentry, Shai Halevi, Nigel P. Smart