Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
From MaRDI portal
Publication:2096626
DOI10.1007/978-3-031-09234-3_26OpenAlexW4285276028MaRDI QIDQ2096626
Juan Troncoso-Pastoriza, Jean-Philippe Bossuat, Jean-Pierre Hubaux
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_26
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- Better bootstrapping for approximate homomorphic encryption
- 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
- On the security of homomorphic encryption on approximate numbers
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- Improved bootstrapping for approximate homomorphic encryption
- Homomorphic encryption for arithmetic of approximate numbers
- On Ideal Lattices and Learning with Errors over Rings
This page was built for publication: Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation