Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR18-125 | 7th July 2018 07:39

Fundamentals of Fully Homomorphic Encryption – A Survey

RSS-Feed




TR18-125
Authors: Zvika Brakerski
Publication: 7th July 2018 10:58
Downloads: 359
Keywords: 


Abstract:

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.



ISSN 1433-8092 | Imprint