Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
From MaRDI portal
Publication:2056705
DOI10.1007/978-3-030-77870-5_21zbMath1479.94132OpenAlexW3094696138MaRDI QIDQ2056705
Jean-Philippe Bossuat, Jean-Pierre Hubaux, Juan Troncoso-Pastoriza, Christian Mouchet
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_21
Related Items
Approximate homomorphic encryption with reduced approximation error, Sine series approximation of the mod function for bootstrapping of approximate HE, High-precision bootstrapping for approximate homomorphic encryption by error variance minimization, BLEACH: cleaning errors in discrete computations over CKKS, Secure sampling with sublinear communication, Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping, EvalRound algorithm in CKKS bootstrapping, Transciphering framework for approximate homomorphic encryption, Fast blind rotation for bootstrapping FHEs, Accelerating HE operations from key decomposition technique, An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption, Bootstrapping for BGV and BFV revisited, High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function, Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
Uses Software
Cites Work
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- On the concrete hardness of learning with errors
- Better bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- Faster homomorphic linear transformations in HElib
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- A full RNS variant of approximate homomorphic encryption
- An improved RNS variant of the BFV homomorphic encryption scheme
- Improved bootstrapping for approximate homomorphic encryption
- Homomorphic encryption for arithmetic of approximate numbers
- Algorithms in HElib
- Homomorphic Evaluation of the AES Circuit
- Bootstrapping for HElib
- Fully homomorphic encryption using ideal lattices