fhe

swMATH23227MaRDI QIDQ35011FDOQ35011

Author name not available (Why is that?)

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

Cited In (41)

• Accelerating Homomorphic Computations on Rational Numbers
• Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Efficient homomorphic conversion between (ring) LWE ciphertexts
• Revisiting orthogonal lattice attacks on approximate common divisor problems
• Polly cracker, revisited
• Homomorphic Encryption
• Multikey Fully Homomorphic Encryption and Applications
• CRT-based fully homomorphic encryption over the integers
• The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
• LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE
• Algorithms for CRT-variant of approximate greatest common divisor problem
• FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
• Some security bounds for the key sizes of DGHV scheme
• Cryptanalysis of a homomorphic encryption scheme
• Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges
• The Geometry of Lattice Cryptography
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
• Secret computation of purchase history data using somewhat homomorphic encryption
• Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption
• Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
• Bootstrapping for helib
• New Ideas to Build Noise-Free Homomorphic Cryptosystems
• Cryptographic algorithms for privacy-preserving online applications
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
• An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
• Efficient and Provable White-Box Primitives
• A new scale-invariant homomorphic encryption scheme
• (Leveled) fully homomorphic encryption without bootstrapping
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
• Multi-user security bound for filter permutators in the random oracle model
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
• Flattening NTRU for evaluation key free homomorphic encryption
• Towards faster polynomial-time lattice reduction
• Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud
• Cryptanalysis of a Homomorphic Encryption Scheme Over Integers
• A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation
• Keyed-fully homomorphic encryption without indistinguishability obfuscation
• Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service

This page was built for software: fhe