Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
From MaRDI portal
Publication:6636116
DOI10.1007/978-3-031-58868-6_12MaRDI QIDQ6636116
Publication date: 12 November 2024
Cites Work
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Bootstrapping for approximate homomorphic encryption
- A full RNS variant of approximate homomorphic encryption
- On the security of homomorphic encryption on approximate numbers
- Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation
- Approximate homomorphic encryption with reduced approximation error
- TFHE: fast fully homomorphic encryption over the torus
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- On error distributions in ring-based LWE
- The Algorithmic Foundations of Differential Privacy
- A Toolkit for Ring-LWE Cryptography
- Fully homomorphic encryption using ideal lattices
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- On lattices, learning with errors, random linear codes, and cryptography
- Optimisations and tradeoffs for HElib
- Securing approximate homomorphic encryption using differential privacy
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- On the precision loss in approximate homomorphic encryption
This page was built for publication: Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
