UPDF AI

Fully homomorphic encryption using ideal lattices

Craig Gentry

2009 · DOI: 10.1145/1536414.1536440
Symposium on the Theory of Computing · 7,176 Citations

TLDR

This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.