Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
From MaRDI portal
Publication:2894423
DOI10.1007/978-3-642-29011-4_27zbMath1297.94062OpenAlexW1948403713WikidataQ28002956 ScholiaQ28002956MaRDI QIDQ2894423
David Naccache, Jean-Sébastien Coron, Mehdi Tibouchi
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_27
Related Items (33)
Towards faster polynomial-time lattice reduction ⋮ Polly cracker, revisited ⋮ New Ideas to Build Noise-Free Homomorphic Cryptosystems ⋮ 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 ⋮ Cryptanalysis of the Co-ACD Assumption ⋮ Bootstrapping for helib ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Multi-user security bound for filter permutators in the random oracle model ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ Efficient and Provable White-Box Primitives ⋮ Fast practical lattice reduction through iterated compression ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Cryptanalysis of a Homomorphic Encryption Scheme Over Integers ⋮ Unsupervised Machine Learning on encrypted data ⋮ Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service ⋮ 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 ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud ⋮ Accelerating Homomorphic Computations on Rational Numbers ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation ⋮ A new scale-invariant homomorphic encryption scheme ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
Uses Software
This page was built for publication: Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
