Faster Fully Homomorphic Encryption
From MaRDI portal
Publication:3058667
DOI10.1007/978-3-642-17373-8_22zbMath1290.94133OpenAlexW1853548709WikidataQ28002556 ScholiaQ28002556MaRDI QIDQ3058667
Publication date: 7 December 2010
Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17373-8_22
Related Items
New Ideas to Build Noise-Free Homomorphic Cryptosystems, A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties, Anonymity of NIST PQC round 3 KEMs, Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms, On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes, Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes, Applied homomorphic cryptography: examples, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, Fast blind rotation for bootstrapping FHEs, LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme, CRT-based fully homomorphic encryption over the integers, (Leveled) Fully Homomorphic Encryption without Bootstrapping, CCA-Secure Keyed-Fully Homomorphic Encryption, The Geometry of Lattice Cryptography, FHE Circuit Privacy Almost for Free, On Constructing Homomorphic Encryption Schemes from Coding Theory
