Bootstrapping fully homomorphic encryption over the integers in less than one second
From MaRDI portal
Publication:2061925
DOI10.1007/978-3-030-75245-3_13zbMATH Open1479.94242OpenAlexW3081517513MaRDI QIDQ2061925FDOQ2061925
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_13
Cites Work
- BKZ 2.0: Better Lattice Security Estimates
- Fully Homomorphic Encryption with Polylog Overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- (Leveled) fully homomorphic encryption without bootstrapping
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Title not available (Why is that?)
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Batch Fully Homomorphic Encryption over the Integers
- Fully Homomophic Encryption over the Integers Revisited
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Bootstrapping with Polynomial Error
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Algorithms for the approximate common divisor problem
- Security Analysis of Multilinear Maps over the Integers
- On Kilian's randomization of multilinear map encodings
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
Cited In (5)
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
- Fast blind rotation for bootstrapping FHEs
- Improved bootstrapping for approximate homomorphic encryption
- FINAL: faster FHE instantiated with NTRU and LWE
This page was built for publication: Bootstrapping fully homomorphic encryption over the integers in less than one second
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061925)
