fhe

swMATH23227MaRDI QIDQ35011

No author found.

Source code repository: https://github.com/coron/fhe

Related Items (41)

Towards faster polynomial-time lattice reduction ⋮ Polly cracker, revisited ⋮ Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers ⋮ 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 ⋮ Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption ⋮ Bootstrapping for helib ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Secret computation of purchase history data using somewhat homomorphic encryption ⋮ 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 ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ 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 ⋮ 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 ⋮ Some security bounds for the key sizes of DGHV scheme ⋮ 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 ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ Fully Homomorphic Encryption over the Integers with Shorter Public Keys ⋮ 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 ⋮ Accelerating Homomorphic Computations on Rational Numbers ⋮ A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation ⋮ A new scale-invariant homomorphic encryption scheme ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation ⋮ Homomorphic Encryption ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

This page was built for software: fhe