(Leveled) fully homomorphic encryption without bootstrapping

2012/01/08 by Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan · 4 citations
Computer Science · #Cryptography and Data Security #Complexity and Algorithms in Graphs #Cryptographic Implementations and Security

paper · doi:10.1145/2090236.2090262

openalex publication_date 2012/01/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual contribution in our work is a new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits), without Gentry's bootstrapping procedure.

Citations

• On Ideal Lattices and Learning with Errors over Rings
• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

Cited by

• HEAX: An Architecture for Computing on Encrypted Data
• SoK: Cryptographically Protected Database Search
• EFFACT: A Highly Efficient Full-Stack FHE Acceleration Platform
• Gödel Prize [wikipedia]

Related

• An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem
• FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption
• Fully Homomorphic Encryption based on Multivariate Polynomial Evaluation
• Practical Solutions in Fully Homomorphic Encryption -- A Survey Analyzing Existing Acceleration Methods
• Bootstrapping as a Morphism: An Arithmetic Geometry Approach to Asymptotically Faster Homomorphic Encryption