(Leveled) fully homomorphic encryption without bootstrapping

By Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan. 2012

177 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

Citations in the corpus

• HEAX: An Architecture for Computing on Encrypted Data (2019, neutral): “In [58], a GPU-based implementation of BGV scheme [11] is introduced.”
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP (2012, unknown): “In order to reduce the norm, we use binary decomposition (which was used in [3,5] for different purposes).”
• How to use indistinguishability obfuscation: deniable encryption, and more (2014, unknown): “We believe the work of [12] is likely to lead to significant follow-up research proposing alternative constructions of indistinguishability obfuscators under various other (possibly standard) assumptions, perhaps in a manner similar to research on Fully Homomorphic Encryption [14, 7, 6, 5, 15].”