Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
From MaRDI portal
Publication:2056705
DOI10.1007/978-3-030-77870-5_21zbMATH Open1479.94132OpenAlexW3094696138MaRDI QIDQ2056705FDOQ2056705
Authors: Jean-Philippe Bossuat, Christian Mouchet, Juan Troncoso-Pastoriza, Jean-Pierre Hubaux 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_21
Recommendations
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- Improved bootstrapping for approximate homomorphic encryption
- Better bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
Cites Work
- Faster homomorphic linear transformations in HElib
- Homomorphic evaluation of the AES circuit
- Bootstrapping for HElib
- Fully homomorphic encryption using ideal lattices
- (Leveled) fully homomorphic encryption without bootstrapping
- A full RNS variant of approximate homomorphic encryption
- On the concrete hardness of learning with errors
- Better bootstrapping for approximate homomorphic encryption
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- Bootstrapping for approximate homomorphic encryption
- Algorithms in HElib
- Improved bootstrapping for approximate homomorphic encryption
Cited In (22)
- Transciphering framework for approximate homomorphic encryption
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- Secure sampling with sublinear communication
- Approximate homomorphic encryption with reduced approximation error
- Accelerating HE operations from key decomposition technique
- Fast blind rotation for bootstrapping FHEs
- BLEACH: cleaning errors in discrete computations over CKKS
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Sine series approximation of the mod function for bootstrapping of approximate HE
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
- Improved bootstrapping for approximate homomorphic encryption
- Bootstrapping for BGV and BFV revisited
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- FHEW with Efficient Multibit Bootstrapping
- Better bootstrapping for approximate homomorphic encryption
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- EvalRound algorithm in CKKS bootstrapping
Uses Software
This page was built for publication: Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056705)
