A full RNS variant of approximate homomorphic encryption
From MaRDI portal
Publication:1726685
DOI10.1007/978-3-030-10970-7_16zbMath1447.94026OpenAlexW2899140612MaRDI QIDQ1726685
Kyoohyung Han, Jung Hee Cheon, Andrey Kim, Miran Kim, Yongsoo Song
Publication date: 20 February 2019
Full work available at URL: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8048025
Related Items (12)
Approximate homomorphic encryption with reduced approximation error ⋮ Sine series approximation of the mod function for bootstrapping of approximate HE ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ Accelerating HE operations from key decomposition technique ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ 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 ⋮ Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- Bootstrapping for approximate homomorphic encryption
- Fixed-point arithmetic in SHE schemes
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- High-precision arithmetic in homomorphic encryption
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- Faster arithmetic for number-theoretic transforms
- Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
- NFLlib: NTT-Based Fast Lattice Library
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Fully Homomorphic Encryption over the Integers
- ML Confidential: Machine Learning on Encrypted Data
- Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
- Fully homomorphic encryption using ideal lattices
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Faster Homomorphic Evaluation of Discrete Fourier Transforms
This page was built for publication: A full RNS variant of approximate homomorphic encryption
