Fully Homomorphic Encryption Using Ideal Lattices

URL: https://dl.acm.org/doi/10.1145/1536414.1536440 Authors: Craig Gentry

Abstract

We propose the first fully homomorphic encryption scheme. Specifically, we construct a scheme that allows us to evaluate an arbitrary number of additions and multiplications on encrypted data, and therefore compute any function on encrypted data. Such a scheme has obvious applications: it can be used for privacy-preserving outsourced computation, cloud computing, and delegation of computation. Our construction is based on a hard problem in ideal lattices, and uses a bootstrapping technique to refresh ciphertexts as they become too noisy from repeated homomorphic operations.