Pages that link to "Item:Q4924419"
From MaRDI portal
The following pages link to Batch Fully Homomorphic Encryption over the Integers (Q4924419):
Displayed 38 items.
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← 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)
- 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)
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic (Q2229267) (← links)
- Some security bounds for the key sizes of DGHV scheme (Q2254535) (← links)
- Encrypted data processing with homomorphic re-encryption (Q2293264) (← links)
- TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption (Q2403232) (← links)
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression (Q2413618) (← links)
- Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011) (← links)
- Bootstrapping for helib (Q2661696) (← links)
- A Simple and Improved Algorithm for Integer Factorization with Implicit Hints (Q2790046) (← links)
- Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes (Q2817869) (← 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)
- Algorithms for the approximate common divisor problem (Q2970999) (← links)
- Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based (Q2980857) (← links)
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers (Q2980858) (← links)
- Fully Homomorphic Encryption for Point Numbers (Q2980860) (← links)
- Cryptanalysis of the Co-ACD Assumption (Q3457128) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression (Q4639486) (← 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)
- Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges (Q5739024) (← links)
- EvalRound algorithm in CKKS bootstrapping (Q6132409) (← links)
- Fast practical lattice reduction through iterated compression (Q6145939) (← links)
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials (Q6157516) (← links)
- Fully homomorphic encryption scheme and Fermat’s little theorem (Q6183984) (← links)