Fully homomorphic encryption over the integers with shorter public keys
From MaRDI portal
(Redirected from Publication:5199209)
Recommendations
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Implementing Gentry's fully-homomorphic encryption scheme
- Batch fully homomorphic encryption over the integers
Cited in
(59)- Homomorphically encrypted arithmetic operations over the integer ring
- Practical homomorphic encryption over the integers for secure computation in the cloud
- Fully homomorphic encryption from the finite field isomorphism problem
- CRT-based fully homomorphic encryption over the integers
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- Partially homomorphic encryption schemes over finite fields
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- 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
- Accelerating integer based fully homomorphic encryption using frequency domain multiplication
- Some security bounds for the key sizes of DGHV scheme
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
- Fully homomorphic SIMD operations
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
- Practical techniques building on encryption for protecting and managing data in the cloud
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Polly cracker, revisited
- On the CCA-1 security of somewhat homomorphic encryption over the integers
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Fully homomophic encryption over the integers revisited
- (Batch) fully homomorphic encryption over integers for non-binary message spaces
- Efficient and Provable White-Box Primitives
- Algorithms for the approximate common divisor problem
- Cryptanalysis of a homomorphic encryption scheme over integers
- Homomorphic encryption: from private-key to public-key
- Implementing Gentry's fully-homomorphic encryption scheme
- The geometry of lattice cryptography
- Fully homomorphic encryption with auxiliary inputs
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully homomorphic encryption over the integers
- Multikey fully homomorphic encryption and applications
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Batch fully homomorphic encryption over the integers
- Encoding of rational numbers and their homomorphic computations for FHE-based applications
- 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
- Homomorphic encryption
- An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
- Scale-invariant fully homomorphic encryption over the integers
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Fast practical lattice reduction through iterated compression
- Computing primitive idempotents in finite commutative rings and applications
- Fully homomorphic encryption scheme and Fermat’s little theorem
- Fast blind rotation for bootstrapping FHEs
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- Biometric-based two-factor authentication scheme under database leakage
- Secure outsourced matrix multiplication with fully homomorphic encryption
- Cryptanalysis of a homomorphic encryption scheme
- Efficient evaluation algorithms for noiseless fully homomorphic encryption scheme and their applications
- Truncated multiplication and batch software SIMD AVX512 implementation for faster Montgomery multiplications and modular exponentiation
- A new scale-invariant homomorphic encryption scheme
- Secret computation of purchase history data using somewhat homomorphic encryption
- (Leveled) fully homomorphic encryption without bootstrapping
This page was built for publication: Fully homomorphic encryption over the integers with shorter public keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199209)
