Leveled homomorphic encryption over composite groups
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A method for obtaining digital signatures and public-key cryptosystems
- Accelerating BGV bootstrapping for large \(p\) using null polynomials over \(\mathbb{Z}_{p^e} \)
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Candidate Multilinear Maps from Ideal Lattices
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
- Efficient fully homomorphic encryption from (standard) LWE
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic encryption: from private-key to public-key
- Improved security for a ring-based fully homomorphic encryption scheme
- On Kilian's randomization of multilinear map encodings
- On lattices, learning with errors, random linear codes, and cryptography
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Theory of Cryptography
This page was built for publication: Leveled homomorphic encryption over composite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877599)
