Sciweavers

STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 7 months ago
Fully homomorphic encryption using ideal lattices
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...
Craig Gentry