Fully Homomorphic Encryption over the Integers
Fully Homomorphic Encryption over the Integers
Marten van Dijk,Craig Gentry,S. Halevi,V. Vaikuntanathan
2010 · DOI: 10.1007/978-3-642-13190-5_2
International Conference on the Theory and Application of Cryptographic Techniques · 1,939 Citations
TLDR
A fully homomorphic encryption scheme, using only elementary modular arithmetic, that reduces the security of the scheme to finding an approximate integer gcd, and investigates the hardness of this task, building on earlier work of Howgrave-Graham.