Introduces a new way of constructing leveled fully homomorphic encryption schemes — capable of evaluating arbitrary polynomial-size circuits — without Gentry's bootstrapping procedure.
Offers a choice of FHE schemes based on the learning with errors (LWE) or ring-LWE problems, with 2^λ security against known attacks.
Dramatically improves performance and bases security on weaker assumptions than earlier constructions.