On the precision loss in approximate homomorphic encryption
From MaRDI portal
Publication:6620056
DOI10.1007/978-3-031-53368-6_16zbMATH Open1547.94343MaRDI QIDQ6620056
Erin Hales, Anamaria Costache, Rachel Player, Sean Murphy, Tabitha Ogilvie, Benjamin R. Curtis
Publication date: 16 October 2024
Cites Work
- Bootstrapping for approximate homomorphic encryption
- A full RNS variant of approximate homomorphic encryption
- Discretisation and product distributions in ring-LWE
- On the security of homomorphic encryption on approximate numbers
- Approximate homomorphic encryption with reduced approximation error
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- TFHE: fast fully homomorphic encryption over the torus
- Homomorphic encryption for arithmetic of approximate numbers
- Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
- (Leveled) fully homomorphic encryption without bootstrapping
- Multiparty Computation from Somewhat Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
- Optimisations and tradeoffs for HElib
- Securing approximate homomorphic encryption using differential privacy
- Revisiting homomorphic encryption schemes for finite fields
Related Items (1)
This page was built for publication: On the precision loss in approximate homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620056)
