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.94062WikidataQ28002956 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
94A60: Cryptography
Related Items
Multikey Fully Homomorphic Encryption and Applications, New Ideas to Build Noise-Free Homomorphic Cryptosystems, An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers, 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, Polly cracker, revisited, Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service, Cryptanalysis of a homomorphic encryption scheme, A new scale-invariant homomorphic encryption scheme, Unsupervised Machine Learning on encrypted data, CRT-based fully homomorphic encryption over the integers, The polynomial approximate common divisor problem and its application to the fully homomorphic encryption, Algorithms for CRT-variant of approximate greatest common divisor problem, Bootstrapping fully homomorphic encryption over the integers in less than one second, Efficient homomorphic conversion between (ring) LWE ciphertexts, Revisiting orthogonal lattice attacks on approximate common divisor problems, Towards faster polynomial-time lattice reduction, Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction, Flattening NTRU for evaluation key free homomorphic encryption, Multi-user security bound for filter permutators in the random oracle model, Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem, Bootstrapping for helib, Cryptographic algorithms for privacy-preserving online applications, Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud, Accelerating Homomorphic Computations on Rational Numbers, A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation, On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes, Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes, Efficient and Provable White-Box Primitives, Cryptanalysis of a Homomorphic Encryption Scheme Over Integers, Cryptanalysis of the Co-ACD Assumption
Uses Software
