Practical dense-key bootstrapping with subring secret encapsulation
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
- Algorithms in HElib
- Better bootstrapping for approximate homomorphic encryption
- 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
- Discretization error reduction for high precision torus fully homomorphic encryption
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Error of truncated Chebyshev series and other near minimax polynomial approximations
- Faster BGV bootstrapping for power-of-two cyclotomics through homomorphic NTT
- Faster homomorphic linear transformations in HElib
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- 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 Encryption Standard
- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- How to meet ternary LWE keys
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- Improved bootstrapping for approximate homomorphic encryption
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- Practical bootstrapping in quasilinear time
- Practical FHE parameters against lattice attacks
- Ring switching in BGV-style homomorphic encryption
- Sine series approximation of the mod function for bootstrapping of approximate HE
- TFHE: fast fully homomorphic encryption over the torus
- The cool and the cruel: separating hard parts of LWE secrets
This page was built for publication: Practical dense-key bootstrapping with subring secret encapsulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232712)
