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...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery,
2014-10-17T13:26:11Z.
|
| Subjects: | |
| Online Access: | Get fulltext |