Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
From MaRDI portal
Publication:6605318
Recommendations
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- Homomorphic lower digits removal and improved FHE bootstrapping
- Practical bootstrapping in quasilinear time
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
Cites work
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- Algorithms in HElib
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization
- Better bootstrapping for approximate homomorphic encryption
- Bootstrapping for BGV and BFV revisited
- Bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- Bootstrapping for helib
- Class Field Theory
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- FHEW: bootstrapping homomorphic encryption in less than a second
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic SIMD operations
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- 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 from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic lower digits removal and improved FHE bootstrapping
- Improved bootstrapping for approximate homomorphic encryption
- On lattices, learning with errors, random linear codes, and cryptography
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- On the concrete hardness of learning with errors
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- Practical bootstrapping in quasilinear time
- Ring packing and amortized FHEW bootstrapping
- 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
Cited in
(2)
This page was built for publication: Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605318)
