Homomorphic encryption for arithmetic of approximate numbers
From MaRDI portal
Publication:2412881
DOI10.1007/978-3-319-70694-8_15zbMath1420.94051OpenAlexW2768174108WikidataQ61068279 ScholiaQ61068279MaRDI QIDQ2412881
Yongsoo Song, Andrey Kim, Jung Hee Cheon, Miran Kim
Publication date: 6 April 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70694-8_15
Related Items
Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM ⋮ Faster homomorphic encryption over GPGPUs via hierarchical DGT ⋮ When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead ⋮ Approximate homomorphic encryption with reduced approximation error ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Private computation of polynomials over networks ⋮ Sine series approximation of the mod function for bootstrapping of approximate HE ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Field instruction multiple data ⋮ Bootstrapping for helib ⋮ Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Privacy-preserving multikey computing framework for encrypted data in the cloud ⋮ BLEACH: cleaning errors in discrete computations over CKKS ⋮ Optimisations and tradeoffs for HElib ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Efficiently processing complex-valued data in homomorphic encryption ⋮ Parameter optimization and larger precision for (T)FHE ⋮ SecureBiNN: 3-party secure computation for binarized neural network inference ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Homomorphic encryption: a mathematical survey ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ Balanced non-adjacent forms ⋮ Revisiting homomorphic encryption schemes for finite fields ⋮ Transciphering framework for approximate homomorphic encryption ⋮ Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE ⋮ Reduction-free multiplication for finite fields and polynomial rings ⋮ More efficient verifiable functional encryption ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts ⋮ \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain ⋮ Coefficient grouping for complex affine layers ⋮ Fast blind rotation for bootstrapping FHEs ⋮ HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering ⋮ Accelerating HE operations from key decomposition technique ⋮ Private AI: Machine Learning on Encrypted Data ⋮ Toward practical privacy-preserving linear regression ⋮ Maliciously secure matrix multiplication with applications to private deep learning ⋮ Efficient homomorphic comparison methods with optimal complexity ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption ⋮ A full RNS variant of approximate homomorphic encryption ⋮ Unnamed Item ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes ⋮ 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 ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting ⋮ Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation ⋮ PSI-stats: private set intersection protocols supporting secure statistical functions ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
