Bootstrapping fully homomorphic encryption over the integers in less than one second

DOI10.1007/978-3-030-75245-3_13zbMath1479.94242OpenAlexW3081517513MaRDI QIDQ2061925

Hilder Vitor Lima Pereira

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_13

zbMATH Keywords

bootstrappingfully homomorphic encryptionAGCD

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

FINAL: faster FHE instantiated with NTRU and LWE ⋮ Fast blind rotation for bootstrapping FHEs

Cites Work

• Unnamed Item
• On Kilian's randomization of multilinear map encodings
• Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Security Analysis of Multilinear Maps over the Integers
• Faster Bootstrapping with Polynomial Error
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Fully Homomorphic Encryption with Polylog Overhead
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully Homomophic Encryption over the Integers Revisited
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• Algorithms for the approximate common divisor problem
• BKZ 2.0: Better Lattice Security Estimates
• Fully Homomorphic Encryption over the Integers
• Batch Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime