Fully Homomorphic Encryption over the Integers with Shorter Public Keys
From MaRDI portal
Publication:5199209
DOI10.1007/978-3-642-22792-9_28zbMath1290.94059OpenAlexW1497981337WikidataQ28002982 ScholiaQ28002982MaRDI QIDQ5199209
Mehdi Tibouchi, David Naccache, Avradip Mandal, Jean-Sébastien Coron
Publication date: 12 August 2011
Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_28
Related Items
Towards faster polynomial-time lattice reduction ⋮ Polly cracker, revisited ⋮ 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 ⋮ Fully Homomorphic Encryption with Auxiliary Inputs ⋮ Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Secret computation of purchase history data using somewhat homomorphic encryption ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ Efficient and Provable White-Box Primitives ⋮ Fast practical lattice reduction through iterated compression ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Fully homomorphic encryption scheme and Fermat’s little theorem ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Algorithms for the approximate common divisor problem ⋮ Cryptanalysis of a Homomorphic Encryption Scheme Over Integers ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ Cryptanalysis of a homomorphic encryption scheme ⋮ CRT-based fully homomorphic encryption over the integers ⋮ The polynomial approximate common divisor problem and its application to the fully homomorphic encryption ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Some security bounds for the key sizes of DGHV scheme ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud ⋮ Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption ⋮ Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ The Geometry of Lattice Cryptography ⋮ A new scale-invariant homomorphic encryption scheme ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation ⋮ Homomorphic Encryption ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
Uses Software
This page was built for publication: Fully Homomorphic Encryption over the Integers with Shorter Public Keys
