Fully Homomophic Encryption over the Integers Revisited

DOI10.1007/978-3-662-46800-5_20zbMath1370.94496OpenAlexW924029577MaRDI QIDQ2948342

Jung Hee Cheon, Damien Stehlé

Publication date: 30 September 2015

Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46800-5_20

zbMATH Keywords

LWEfully homomorphic encryptionapproximate GCDDGHV

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (23)

Towards faster polynomial-time lattice reduction ⋮ Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem ⋮ An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers ⋮ On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Homomorphic encryption: a mathematical survey ⋮ Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Balanced non-adjacent forms ⋮ Cryptanalysis of a Homomorphic Encryption Scheme Over Integers ⋮ Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ Provably Secure (Broadcast) Homomorphic Signcryption ⋮ Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ A new scale-invariant homomorphic encryption scheme ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

This page was built for publication: Fully Homomophic Encryption over the Integers Revisited