Fully homomorphic encryption for matrix arithmetic
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A toolkit for ring-LWE cryptography
- Better bootstrapping for approximate homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- Ciphertext-ciphertext matrix multiplication: fast for large matrices
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Faster homomorphic linear transformations in HElib
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- Matrix multiplication via arithmetic progressions
- On ideal lattices and learning with errors over rings
- Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
- Secure and efficient outsourced matrix multiplication with homomorphic encryption
This page was built for publication: Fully homomorphic encryption for matrix arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443236)