| dc.contributor.author | Brakerski, Zvika | |
| dc.contributor.author | Vaikuntanathan, Vinod | |
| dc.date.accessioned | 2014-10-17T13:26:11Z | |
| dc.date.available | 2014-10-17T13:26:11Z | |
| dc.date.issued | 2014-01 | |
| dc.identifier.isbn | 9781450326988 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/90959 | |
| dc.description.abstract | 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 known hardness for "regular" (non-homomorphic) lattice based public-key encryption up to the ε factor. A number of previous methods had hit a roadblock at quasipolynomial approximation. (As usual, a circular security assumption can be used to achieve a non-leveled FHE scheme.) | en_US |
| dc.description.sponsorship | Alfred P. Sloan Foundation (Fellowship) | en_US |
| dc.description.sponsorship | Qatar Computing Research Institute | en_US |
| dc.description.sponsorship | University of Toronto (Connaught New Researcher award) | en_US |
| dc.description.sponsorship | United States. Defense Advanced Research Projects Agency (DARPA Grant number FA8750-11-2-0225) | en_US |
| dc.description.sponsorship | Natural Sciences and Engineering Research Council of Canada (NSERC Discovery Grant) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Association for Computing Machinery | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1145/2554797.2554799 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | Other repository | en_US |
| dc.title | Lattice-based FHE as secure as PKE | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Brakerski, Zvika, and Vinod Vaikuntanathan. “Lattice-Based FHE as Secure as PKE.” Proceedings of the 5th Conference on Innovations in Theoretical Computer Science - ITCS ’14 January 12–14, 2014, Princeton, New Jersey, USA. ACM, p.1-12. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Vaikuntanathan, Vinod | en_US |
| dc.relation.journal | Proceedings of the 5th Conference on Innovations in Theoretical Computer Science - ITCS '14 | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Brakerski, Zvika; Vaikuntanathan, Vinod | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-2666-0045 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
