A BGV-subroutined CKKS bootstrapping algorithm without sine approximation
From MaRDI portal
Cites work
- Bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- Bootstrapping for BGV and BFV revisited
- Bootstrapping for HElib
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic lower digits removal and improved FHE bootstrapping
- Implementing Gentry's fully-homomorphic encryption scheme
- Practical bootstrapping in quasilinear time
- Privacy preserving computation in cloud using noise-free fully homomorphic encryption (FHE) schemes
- Sine series approximation of the mod function for bootstrapping of approximate HE
This page was built for publication: A BGV-subroutined CKKS bootstrapping algorithm without sine approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846303)