An optimized GHV-type HE scheme: simpler, faster, and more versatile
From MaRDI portal
Publication:2096603
DOI10.1007/978-3-031-09234-3_3OpenAlexW3215157363MaRDI QIDQ2096603
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_3
Uses Software
Cites Work
- Unnamed Item
- Generating shorter bases for hard random lattices
- Gaussian sampling over the integers: efficient, generic, constant-time
- Candidate iO from homomorphic encryption schemes
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
- Additively homomorphic IBE from higher residuosity
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Packing Messages and Optimizing Bootstrapping in GSW-FHE
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Homomorphic Encryption over the Integers
- A Simple BGN-Type Cryptosystem from LWE
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Probability Inequalities for Sums of Bounded Random Variables
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: An optimized GHV-type HE scheme: simpler, faster, and more versatile
