fhe

swMATH23227MaRDI QIDQ35011FDOQ35011

Author name not available (Why is that?)

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

Cited In (41)

• Fully homomorphic encryption over the integers with shorter public keys
• 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
• The geometry of lattice cryptography
• Polly cracker, revisited
• Minimizing the number of bootstrappings in fully homomorphic encryption
• 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
• 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
• 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
• Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
• Encoding of rational numbers and their homomorphic computations for FHE-based applications
• Bootstrapping for helib
• LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
• Cryptographic algorithms for privacy-preserving online applications
• Practical techniques building on encryption for protecting and managing data in the cloud
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
• Homomorphic encryption
• Cryptanalysis of a homomorphic encryption scheme over integers
• An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
• Efficient and Provable White-Box Primitives
• A new scale-invariant homomorphic encryption scheme
• A unified approach to idealized model separations via indistinguishability obfuscation
• (Leveled) fully homomorphic encryption without bootstrapping
• Somewhat/fully homomorphic encryption: implementation progresses and challenges
• Multikey fully homomorphic encryption and applications
• 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
• Accelerating homomorphic computations on rational numbers
• Keyed-fully homomorphic encryption without indistinguishability obfuscation
• Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
• New ideas to build noise-free homomorphic cryptosystems

This page was built for software: fhe