Efficient Fully Homomorphic Encryption from (Standard) LWE
A fully homomorphic encryption (FHE) scheme allows anyone to transform an encryption of a message, m, into an encryption of any (efficient) function of that message, f(m), without knowing the secret key. We present a leveled FHE scheme that is based solely on the (standard) learning with errors (LWE...
Main Authors: | Brakerski, Zvika, Vaikuntanathan, Vinod |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Published: |
Society for Industrial & Applied Mathematics (SIAM)
2018
|
Online Access: | http://hdl.handle.net/1721.1/115488 https://orcid.org/0000-0002-2666-0045 |
Similar Items
-
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
by: Brakerski, Zvika, et al.
Published: (2017) -
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
by: Brakerski, Zvika, et al.
Published: (2021) -
Private Constrained PRFs (and More) from LWE
by: Brakerski, Zvika, et al.
Published: (2021) -
Towards an efficient LWE‐based fully homomorphic encryption scheme
by: Uddipana Dowerah, et al.
Published: (2022-07-01) -
Obfuscating Conjunctions under Entropic Ring LWE
by: Brakerski, Zvika, et al.
Published: (2017)