18 search results - page 1 / 4 » Minimizing the Number of Bootstrappings in Fully Homomorphic... |
PKC
2012
Springer
12 years 1 months ago
2012
Springer
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
IACR
2011
12 years 10 months ago
2011
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
EUROCRYPT
2011
Springer
13 years 2 months ago
2011
Springer
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort b...
EUROCRYPT
2012
Springer
12 years 1 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...
STOC
2012
ACM
12 years 1 months ago
2012
ACM
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...