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...
| Glavni autori: | , |
|---|---|
| Daljnji autori: | |
| Format: | Članak |
| Jezik: | en_US |
| Izdano: |
Association for Computing Machinery
2014
|
| Online pristup: | http://hdl.handle.net/1721.1/90959 https://orcid.org/0000-0002-2666-0045 |