Improved security for a ring-based fully homomorphic encryption scheme
From MaRDI portal
Recommendations
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Faster fully homomorphic encryption
- (Leveled) fully homomorphic encryption without bootstrapping
- Scale-invariant fully homomorphic encryption over the integers
- (Leveled) fully homomorphic encryption without bootstrapping
Cited in
(45)- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- Bootstrapping for approximate homomorphic encryption
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Security considerations for Galois non-dual RLWE families
- Provably secure NTRUEncrypt over any cyclotomic field
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- A novel fault-tolerant privacy-preserving cloud-based data aggregation scheme for lightweight health data
- Towards faster polynomial-time lattice reduction
- Flattening NTRU for evaluation key free homomorphic encryption
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Error analysis of weak poly-LWE instances
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Depth optimized efficient homomorphic sorting
- Private computation on encrypted genomic data
- Efficient integer encoding for homomorphic encryption via ring isomorphisms
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- Fully homomorphic encryption for point numbers
- Homomorphic AES evaluation using the modified LTV scheme
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
- Blending FHE-NTRU keys -- the excalibur property
- A lattice attack on homomorphic NTRU with non-invertible public keys
- Multikey fully homomorphic encryption and applications
- Attacks on the Search RLWE Problem with Small Errors
- Encoding of rational numbers and their homomorphic computations for FHE-based applications
- Privacy-friendly forecasting for the smart grid using homomorphic encryption and the group method of data handling
- Homomorphic encryption
- Privacy-preserving and yet robust collaborative filtering recommender as a service
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
- Provably secure NTRU instances over prime cyclotomic rings
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- NTRU Fatigue: How Stretched is Overstretched?
- A polynomial time algorithm for breaking NTRU encryption with multiple keys
- FINAL: faster FHE instantiated with NTRU and LWE
- Private AI: Machine Learning on Encrypted Data
- Leveled homomorphic encryption over composite groups
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Leveled homomorphic encryption schemes for homomorphic encryption standard
- Parallel and memory-efficient homomorphically encrypted CNNs using vector and tensor representations
This page was built for publication: Improved security for a ring-based fully homomorphic encryption scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870084)
