Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
From MaRDI portal
Publication:6605318
DOI10.1007/978-981-99-8736-8_3zbMATH Open1547.94403MaRDI QIDQ6605318
Simon Pohmann, Rachel Player, Hiroki Okada
Publication date: 13 September 2024
Cites Work
- Unnamed Item
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- On the concrete hardness of learning with errors
- Better bootstrapping for approximate homomorphic encryption
- Homomorphic lower digits removal and improved FHE bootstrapping
- Bootstrapping for 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
- 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
- TFHE: fast fully homomorphic encryption over the torus
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- Bootstrapping for helib
- Bootstrapping for BGV and BFV revisited
- Practical Bootstrapping in Quasilinear Time
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Algorithms in HElib
- Fully Homomorphic Encryption with Polylog Overhead
- Ring Switching in BGV-Style Homomorphic Encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Class Field Theory
- Ring Packing and Amortized FHEW Bootstrapping
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On lattices, learning with errors, random linear codes, and cryptography
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- 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
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
This page was built for publication: Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
