Bootstrapping for helib
From MaRDI portal
Publication:2661696
DOI10.1007/s00145-020-09368-7zbMath1460.94046OpenAlexW3120341667MaRDI QIDQ2661696
Publication date: 7 April 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-020-09368-7
Related Items
On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption, Scooby: improved multi-party homomorphic secret sharing based on FHE, Scooby: improved multi-party homomorphic secret sharing based on FHE, Fast blind rotation for bootstrapping FHEs, HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering, Bootstrapping for BGV and BFV revisited
Uses Software
Cites Work
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- On the concrete hardness of learning with errors
- Better bootstrapping for approximate homomorphic encryption
- Homomorphic lower digits removal and improved FHE bootstrapping
- Bootstrapping for approximate homomorphic encryption
- Faster homomorphic linear transformations in HElib
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- Practical Bootstrapping in Quasilinear Time
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Algorithms in HElib
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully Homomorphic Encryption with Polylog Overhead
- Better Bootstrapping in Fully Homomorphic Encryption
- Multiparty Computation from Somewhat Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- A Toolkit for Ring-LWE Cryptography
- Batch Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption using ideal lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Asymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic Processes
- On lattices, learning with errors, random linear codes, and cryptography
