Faster homomorphic linear transformations in HElib
From MaRDI portal
Recommendations
Cited in
(26)- Minimizing the number of bootstrappings in fully homomorphic encryption
- On the security of homomorphic encryption on approximate numbers
- Improved efficiency of a linearly homomorphic cryptosystem
- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- HElib
- FASTA -- a stream cipher for fast FHE evaluation
- Encoding of rational numbers and their homomorphic computations for FHE-based applications
- Accelerating HE operations from key decomposition technique
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- Bootstrapping for helib
- Maliciously secure matrix multiplication with applications to private deep learning
- Towards private deep learning-based side-channel analysis using homomorphic encryption. Opportunities and limitations
- Field instruction multiple data
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Faster amortized FHEW bootstrapping using ring automorphisms
- Optimisations and tradeoffs for HElib
- Algorithms in HElib
- Bootstrapping for BGV and BFV revisited
- Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- cuHE: a homomorphic encryption accelerator library
- Fast Hensel's lifting implementation using partial fraction decomposition
- Cheap and fast iterative matrix inverse in encrypted domain
- Secure outsourced matrix multiplication with fully homomorphic encryption
This page was built for publication: Faster homomorphic linear transformations in HElib
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673382)
