Pages that link to "Item:Q5199209"
From MaRDI portal
The following pages link to Fully Homomorphic Encryption over the Integers with Shorter Public Keys (Q5199209):
Displayed 38 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- Polly cracker, revisited (Q285245) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- Cryptanalysis of a homomorphic encryption scheme (Q680918) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Secret computation of purchase history data using somewhat homomorphic encryption (Q890595) (← 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)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← 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)
- Some security bounds for the key sizes of DGHV scheme (Q2254535) (← links)
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption (Q2403232) (← links)
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011) (← links)
- Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud (Q2803632) (← links)
- Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption (Q2807191) (← links)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) (← 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)
- Algorithms for the approximate common divisor problem (Q2970999) (← links)
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers (Q2980858) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Fully Homomorphic Encryption with Auxiliary Inputs (Q3454587) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES (Q4916022) (← links)
- Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications (Q4963266) (← links)
- Homomorphic Encryption (Q5021133) (← 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)
- Fast practical lattice reduction through iterated compression (Q6145939) (← links)
- Computing primitive idempotents in finite commutative rings and applications (Q6149152) (← links)
- Fully homomorphic encryption scheme and Fermat’s little theorem (Q6183984) (← links)
- Fast blind rotation for bootstrapping FHEs (Q6190094) (← links)