Algorithms in HElib
From MaRDI portal
Recommendations
Cited in
(52)- Practical private-key fully homomorphic encryption in rings
- Bootstrapping for approximate homomorphic encryption
- Faster homomorphic linear transformations in HElib
- Fixed-point arithmetic in SHE schemes
- Unsupervised Machine Learning on encrypted data
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- On the security of homomorphic encryption on approximate numbers
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Differential uniformity and linearity of S-boxes by multiplicative complexity
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- Improved filter permutators for efficient FHE: better instances and implementations
- Secure two-party computation in a quantum world
- TFHE: fast fully homomorphic encryption over the torus
- Leakage-resilient biometric-based remote user authentication with fuzzy extractors
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Bootstrapping for helib
- Maliciously secure matrix multiplication with applications to private deep learning
- Private database access with HE-over-ORAM architecture
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- FHEW with Efficient Multibit Bootstrapping
- Blending FHE-NTRU keys -- the excalibur property
- Boolean functions for homomorphic-friendly stream ciphers
- A framework with randomized encoding for a fast privacy preserving calculation of non-linear kernels for machine learning applications in precision medicine
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Ring packing and amortized FHEW bootstrapping
- Homomorphic encryption
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes
- Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- Toward practical privacy-preserving linear regression
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Secure outsourced matrix multiplication with fully homomorphic encryption
- Full domain functional bootstrapping with least significant bit encoding
- Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Faster amortized FHEW bootstrapping using ring automorphisms
- Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused
- Hintless single-server private information retrieval
- Large domain homomorphic evaluation for BFV-like schemes via ring repacking
- Verifiable computation for approximate homomorphic encryption schemes
- Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields
- More efficient functional bootstrapping for general functions in polynomial modulus
- Secure and efficient outsourced matrix multiplication with homomorphic encryption
- Predicting module-lattice reduction
- \textsf{PaCo}: bootstrapping for \textsf{CKKS} via partial \textsf{CoeffToSlot}
- Practical dense-key bootstrapping with subring secret encapsulation
- Carousel: fully homomorphic encryption with bootstrapping over automorphism group
- Vive Galois! I: Optimal SIMD packing and packed bootstrapping for FHE
This page was built for publication: Algorithms in HElib
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874526)
