Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > FULLY HOMOMORPHIC ENCRYPTION:
Reports tagged with fully homomorphic encryption:
TR11-109 | 9th August 2011
Zvika Brakerski, Vinod Vaikuntanathan

#### Efficient Fully Homomorphic Encryption from (Standard) LWE

We present a fully homomorphic encryption scheme that is based solely on the (standard) learning with errors (LWE) assumption. Applying known results on LWE, the security of our scheme is based on the worst-case hardness of short vector problems'' on arbitrary lattices.

Our construction improves on previous works in two ... more >>>

TR11-111 | 10th August 2011
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan

#### Fully Homomorphic Encryption without Bootstrapping

We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual contribution in our work is a new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits), {\em without Gentry's bootstrapping procedure}.

... more >>>

TR18-125 | 7th July 2018
Zvika Brakerski

#### Fundamentals of Fully Homomorphic Encryption – A Survey

A homomorphic encryption scheme is one that allows computing on encrypted data without decrypting it first. In fully homomorphic encryption it is possible to apply any efficiently computable function to encrypted data. We provide a survey on the origins, definitions, properties, constructions and uses of fully homomorphic encryption.

more >>>

ISSN 1433-8092 | Imprint