A new framework for fast homomorphic matrix multiplication
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A toolkit for ring-LWE cryptography
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1861860 (Why is no real title available?)
- More efficient functional bootstrapping for general functions in polynomial modulus
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Practical bootstrapping in quasilinear time
- Secure outsourced matrix multiplication with fully homomorphic encryption
- Which ring based somewhat homomorphic encryption scheme is best?
This page was built for publication: A new framework for fast homomorphic matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944924)