Improved bootstrapping for approximate homomorphic encryption
From MaRDI portal
Publication:2292865
DOI10.1007/978-3-030-17656-3_2zbMATH Open1428.94064OpenAlexW2903536544MaRDI QIDQ2292865FDOQ2292865
Authors: Hao Chen, Ilaria Chillotti, Yongsoo Song 
Publication date: 6 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_2
Recommendations
- Better bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- Better bootstrapping in fully homomorphic encryption
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Approximate homomorphic encryption with reduced approximation error
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Bootstrapping fully homomorphic encryption over the integers in less than one second
Cited In (20)
- Bootstrapping for approximate homomorphic encryption
- On the security of homomorphic encryption on approximate numbers
- 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
- Hybrid dual and meet-LWE attack
- Application of automorphic forms to lattice problems
- 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
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- FHEW with Efficient Multibit Bootstrapping
- Better bootstrapping for approximate homomorphic encryption
- Efficient homomorphic comparison methods with optimal complexity
- Practical FHE parameters against lattice attacks
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- EvalRound algorithm in CKKS bootstrapping
This page was built for publication: Improved bootstrapping for approximate homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292865)
