Fully homomophic encryption over the integers revisited

DOI10.1007/978-3-662-46800-5_20MaRDI QIDQ2948342zbMATH OpenOpenAlexFDO

Authors 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

fully homomorphic encryptionLWEapproximate GCDDGHV

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers with shorter public keys
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• (Leveled) fully homomorphic encryption without bootstrapping
• Scale-invariant fully homomorphic encryption over the integers

Cited in

(30)

• Towards constructing fully homomorphic encryption without ciphertext noise from group theory
• EvalRound algorithm in CKKS bootstrapping
• Fully homomorphic encryption over the integers
• TFHE: fast fully homomorphic encryption over the torus
• Revisiting orthogonal lattice attacks on approximate common divisor problems
• Bootstrapping for approximate homomorphic encryption
• Fully homomorphic encryption from the finite field isomorphism problem
• Revisiting homomorphic encryption schemes for finite fields
• Bootstrapping fully homomorphic encryption over the integers in less than one second
• Algorithms for CRT-variant of approximate greatest common divisor problem
• Cryptanalysis of the co-ACD assumption
• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
• Balanced non-adjacent forms
• Homomorphic lower digits removal and improved FHE bootstrapping
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
• On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
• Cryptanalysis of a homomorphic encryption scheme over integers
• A new scale-invariant homomorphic encryption scheme
• An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
• Partially homomorphic encryption schemes over finite fields
• Provably secure (broadcast) homomorphic signcryption
• Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
• Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
• Multikey fully homomorphic encryption and applications
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Towards faster polynomial-time lattice reduction
• Fractional LWE: a nonlinear variant of LWE
• Homomorphic encryption: a mathematical survey
• 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

This page was built for publication: Fully homomophic encryption over the integers revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948342)