Better bootstrapping for approximate homomorphic encryption
From MaRDI portal
Recommendations
- Improved bootstrapping for approximate homomorphic encryption
- 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
- Bootstrapping for approximate homomorphic encryption
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
Cited in
(36)- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- Bootstrapping for approximate homomorphic encryption
- A full RNS variant of approximate homomorphic encryption
- 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
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- 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
- Improved bootstrapping for approximate homomorphic encryption
- Bootstrapping for helib
- BLEACH: cleaning errors in discrete computations over CKKS
- Hybrid dual and meet-LWE attack
- EvalRound algorithm in CKKS bootstrapping
- Revisiting homomorphic encryption schemes for finite fields
- Transciphering framework for approximate homomorphic encryption
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- Accelerating HE operations from key decomposition technique
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Large domain homomorphic evaluation for BFV-like schemes via ring repacking
- Verifiable computation for approximate homomorphic encryption schemes
- General functional bootstrapping using CKKS
- Ciphertext-ciphertext matrix multiplication: fast for large matrices
- SHIP: a shallow and highly parallelizable CKKS bootstrapping algorithm
- Bootstrapping small integers with CKKS
- Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
- Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings
- A hybrid of lattice-reduction and Meet-LWE via near-collision on Babai's plane
- \textsf{PaCo}: bootstrapping for \textsf{CKKS} via partial \textsf{CoeffToSlot}
- Practical dense-key bootstrapping with subring secret encapsulation
- Leveled homomorphic encryption schemes for homomorphic encryption standard
- Fast homomorphic linear algebra with BLAS
- High-precision functional bootstrapping for CKKS from Fourier extension
- The polynomial set associated with a fixed number of matrix-matrix multiplications
This page was built for publication: Better bootstrapping for approximate homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q785028)