Securing approximate homomorphic encryption using differential privacy
From MaRDI portal
Recommendations
- On the security of homomorphic encryption on approximate numbers
- Approximate homomorphic encryption with reduced approximation error
- Homomorphic encryption for arithmetic of approximate numbers
- On CCA-Secure Somewhat Homomorphic Encryption
- Homomorphic authenticated encryption secure against chosen-ciphertext attack
Cites work
- A full RNS variant of approximate homomorphic encryption
- Approximate homomorphic encryption with reduced approximation error
- Bootstrapping for approximate homomorphic encryption
- Enhanced lattice-based signatures on reconfigurable hardware
- Gaussian sampling over the integers: efficient, generic, constant-time
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic evaluation of the AES circuit
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the bit security of cryptographic primitives
- On the security of homomorphic encryption on approximate numbers
- Probabilistic encryption
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
Cited in
(21)- On the security of homomorphic encryption on approximate numbers
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- On the precision loss in approximate homomorphic encryption
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
- On the practical \(\mathrm{CPA}^D\) security of ``exact and threshold FHE schemes and libraries
- Willow: secure aggregation with one-shot clients
- Homomorphic encryption for large integers from nested residue number systems
- Drifting towards better error probabilities in fully homomorphic encryption schemes
- Revisiting the security of approximate FHE with noise-flooding countermeasures
- Bit security: optimal adversaries, equivalence results, and a toolbox for computational-statistical security analysis
- Bit-security preserving hardness amplification
- Low communication threshold fully homomorphic encryption
- Homomorphic sign evaluation with a RNS representation of integers
- IND-CPA\textsuperscript{C}: a new security notion for conditional decryption in fully homomorphic encryption
- IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- A central limit approach for ring-LWE noise analysis
- On circuit private, multikey and threshold approximate homomorphic encryption
- Relations among new CCA security notions for approximate FHE
- HRA-secure homomorphic lattice-based proxy re-encryption with tight security
This page was built for publication: Securing approximate homomorphic encryption using differential privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155269)
