On the security of homomorphic encryption on approximate numbers
type: Item
instance of: scholarly article
title: On the security of homomorphic encryption on approximate numbers
zbMATH Open document ID: 1479.94211
DOI: 10.1007/978-3-030-77870-5_23
author: Baiyu Li
author: Daniele Micciancio
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440595
zbMATH Keywords: homomorphic encryption scheme
zbMATH Keywords: FHE construction
zbMATH Keywords: approximate encryption scheme
MaRDI profile type: Publication
full work available at URL: 978-3-030-77870-5 23
OpenAlex ID: W3114221980
cites work: Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
cites work: On the Hardness of Learning with Rounding over Small Modulus
cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
cites work: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
cites work: Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform
cites work: Improved bootstrapping for approximate homomorphic encryption
cites work: Bootstrapping for approximate homomorphic encryption
cites work: A full RNS variant of approximate homomorphic encryption
cites work: Homomorphic encryption for arithmetic of approximate numbers
cites work: Sanitization of FHE Ciphertexts
cites work: Fully homomorphic encryption using ideal lattices
cites work: Homomorphic Evaluation of the AES Circuit
cites work: Probabilistic encryption
cites work: Algorithms in HElib
cites work: Bootstrapping for HElib
cites work: Faster homomorphic linear transformations in HElib
cites work: Approximate homomorphic encryption over the conjugate-invariant ring
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: SWIFFT: A Modest Proposal for FFT Hashing
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: A Toolkit for Ring-LWE Cryptography
cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
cites work: Theory of Cryptography
cites work: On lattices, learning with errors, random linear codes, and cryptography
description: scientific article; zbMATH DE number 7440595