On the security of homomorphic encryption on approximate numbers

DOI10.1007/978-3-030-77870-5_23zbMath1479.94211OpenAlexW3114221980MaRDI QIDQ2056709

Daniele Micciancio, Baiyu Li

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_23

zbMATH Keywords

approximate encryption schemeFHE constructionhomomorphic encryption scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Approximate homomorphic encryption with reduced approximation error ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ BLEACH: cleaning errors in discrete computations over CKKS ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ 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

Cites Work

• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Probabilistic encryption
• Bootstrapping for approximate homomorphic encryption
• Faster homomorphic linear transformations in HElib
• A full RNS variant of approximate homomorphic encryption
• Approximate homomorphic encryption over the conjugate-invariant ring
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Improved bootstrapping for approximate homomorphic encryption
• Homomorphic encryption for arithmetic of approximate numbers
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• On the Hardness of Learning with Rounding over Small Modulus
• Sanitization of FHE Ciphertexts
• Algorithms in HElib
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Bootstrapping for HElib
• SWIFFT: A Modest Proposal for FFT Hashing
• Generalized Compact Knapsacks Are Collision Resistant
• A Toolkit for Ring-LWE Cryptography
• Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• On Ideal Lattices and Learning with Errors over Rings
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography