Securing approximate homomorphic encryption using differential privacy
From MaRDI portal
Publication:6155269
DOI10.1007/978-3-031-15802-5_20zbMath1516.94040MaRDI QIDQ6155269
Daniele Micciancio, Baiyu Li, Jessica Sorrell, Mark Schultz
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Cites Work
- Probabilistic encryption
- On the bit security of cryptographic primitives
- Bootstrapping for approximate homomorphic encryption
- Gaussian sampling over the integers: efficient, generic, constant-time
- A full RNS variant of approximate homomorphic encryption
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- On the security of homomorphic encryption on approximate numbers
- Approximate homomorphic encryption with reduced approximation error
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic Evaluation of the AES Circuit
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Enhanced Lattice-Based Signatures on Reconfigurable Hardware
- On Ideal Lattices and Learning with Errors over Rings
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Securing approximate homomorphic encryption using differential privacy