Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
From MaRDI portal
Publication:6636515
DOI10.1007/978-3-031-58723-8_14MaRDI QIDQ6636515
Tairong Huang, Xiaoyun Wang, Anyu Wang, Shihe Ma
Publication date: 12 November 2024
Cites Work
- (Leveled) fully homomorphic encryption without bootstrapping
- On the concrete hardness of learning with errors
- Homomorphic lower digits removal and improved FHE bootstrapping
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Bootstrapping for helib
- Bootstrapping for BGV and BFV revisited
- Bootstrapping for HElib
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- Fully homomorphic encryption using ideal lattices
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
This page was built for publication: Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636515)
