Lattice-based FHE as secure as PKE

Lattice-based FHE as secure as PKE

We show that (leveled) fully homomorphic encryption (FHE) can be based on the hardness of O(n[superscript 1.5+ε])-approximation for lattice problems (such as GapSVP) under quantum reductions for any ε 〉 0 (or O(n[superscript 2+ε])-approximation under classical reductions). This matches the best know...

Full description

Bibliographic Details
Main Authors: Brakerski, Zvika (Author), Vaikuntanathan, Vinod (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery, 2014-10-17T13:26:11Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items