Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
From MaRDI portal
Publication:2894427
DOI10.1007/978-3-642-29011-4_30zbMath1297.94059OpenAlexW1549588538MaRDI QIDQ2894427
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_30
general version (GACD)hardness of approximate integer common divisors problemsnew GACD algorithmnew PACD algorithmpartial version (PACD)simple fully-homomorphic encryption (FHE) schemes
Related Items
Polly cracker, revisited ⋮ Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem ⋮ New Multilinear Maps Over the Integers ⋮ Cryptanalysis of the Co-ACD Assumption ⋮ Partial Key Exposure Attack on CRT-RSA ⋮ Cryptanalysis of a Homomorphic Encryption Scheme Over Integers ⋮ Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic ⋮ 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 ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ A new scale-invariant homomorphic encryption scheme ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation ⋮ On the greatest common divisor of shifted sets ⋮ Finding roots in with the successive resultants algorithm ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
Uses Software
