Fully homomorphic encryption allows you to perform additions and multiplications on encrypted data. We will see the easiest construction which lets us do this, which is the approximate eigenvalue method. This construction assumes that the learning-with-error problem is hard and is due to Gentry, Sahai and Waters.
