Pages that link to "Item:Q2894423"
From MaRDI portal
The following pages link to Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers (Q2894423):
Displayed 32 items.
- Polly cracker, revisited (Q285245) (← links)
- Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service (Q680776) (← links)
- Cryptanalysis of a homomorphic encryption scheme (Q680918) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Unsupervised Machine Learning on encrypted data (Q1726695) (← links)
- CRT-based fully homomorphic encryption over the integers (Q1749613) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- Algorithms for CRT-variant of approximate greatest common divisor problem (Q2025331) (← links)
- Bootstrapping fully homomorphic encryption over the integers in less than one second (Q2061925) (← links)
- Efficient homomorphic conversion between (ring) LWE ciphertexts (Q2117044) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Flattening NTRU for evaluation key free homomorphic encryption (Q2191204) (← links)
- Multi-user security bound for filter permutators in the random oracle model (Q2420473) (← links)
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011) (← links)
- Bootstrapping for helib (Q2661696) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud (Q2803632) (← links)
- Accelerating Homomorphic Computations on Rational Numbers (Q2822686) (← links)
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation (Q2827742) (← links)
- On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes (Q2946478) (← links)
- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes (Q2947538) (← links)
- Efficient and Provable White-Box Primitives (Q2958118) (← links)
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers (Q2980858) (← links)
- Cryptanalysis of the Co-ACD Assumption (Q3457128) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- New Ideas to Build Noise-Free Homomorphic Cryptosystems (Q5048988) (← links)
- An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers (Q5056042) (← links)
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime (Q5738759) (← links)
- LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE (Q5738780) (← links)
- Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges (Q5739024) (← links)