19 search results - page 2 / 4 » Implementing Gentry's Fully-Homomorphic Encryption Scheme |
132
Voted
EUROCRYPT
2012
Springer
13 years 5 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...
144
Voted
CRYPTO
2010
Springer
15 years 3 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...
128
Voted
EUROCRYPT
2010
Springer
15 years 7 months ago
2010
Springer
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
143
Voted
PKC
2010
Springer
15 years 6 months ago
2010
Springer
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic s...
137
Voted
STOC
2009
ACM
15 years 9 months ago
2009
ACM
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...