Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1852136 (Why is no real title available?)
- Algorithms for the approximate common divisor problem
- Batch fully homomorphic encryption over the integers
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Fully homomophic encryption over the integers revisited
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption for finite automata
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- On Kilian's randomization of multilinear map encodings
- Packing messages and optimizing bootstrapping in GSW-FHE
- Scale-invariant fully homomorphic encryption over the integers
- Security analysis of multilinear maps over the integers
Cited in
(3)
This page was built for publication: Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229267)