Pages that link to "Item:Q3562913"
From MaRDI portal
The following pages link to Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes (Q3562913):
Displaying 50 items.
- Polly cracker, revisited (Q285245) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← 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)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm (Q1643980) (← links)
- Unsupervised Machine Learning on encrypted data (Q1726695) (← links)
- CRT-based fully homomorphic encryption over the integers (Q1749613) (← links)
- Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) (Q2009413) (← links)
- Short principal ideal problem in multicubic fields (Q2023319) (← links)
- Geometry of biquadratic and cyclic cubic log-unit lattices (Q2043488) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← 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)
- Computing on authenticated data (Q2344052) (← links)
- Fully homomorphic SIMD operations (Q2439746) (← links)
- Subexponential time relations in the class group of large degree number fields (Q2513760) (← links)
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- CCA-Secure Keyed-Fully Homomorphic Encryption (Q2798772) (← links)
- Accelerating Homomorphic Computations on Rational Numbers (Q2822686) (← links)
- A novel fully homomorphic encryption scheme bsed on LWE (Q2825264) (← links)
- FHE Circuit Privacy Almost for Free (Q2829211) (← links)
- Subexponential class group and unit group computation in large degree number fields (Q2878849) (← links)
- On CCA-Secure Somewhat Homomorphic Encryption (Q2889863) (← links)
- Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms (Q2946465) (← 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)
- Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme (Q2953874) (← links)
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers (Q2980858) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Benaloh’s Dense Probabilistic Encryption Revisited (Q3011926) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme (Q3104682) (← links)
- On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683) (← links)
- Lattice Reduction for Modular Knapsack (Q3455505) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages (Q4916015) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Short Generators Without Quantum Computers: The Case of Multiquadratics (Q5738870) (← links)
- Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
- Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
- Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges (Q5739024) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)