Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
From MaRDI portal
Publication:6085271
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Classical hardness of learning with errors
- FHEW: bootstrapping homomorphic encryption in less than a second
- FINAL: faster FHE instantiated with NTRU and LWE
- Faster Bootstrapping with Polynomial Error
- Faster homomorphic linear transformations in HElib
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Hardness of LWE on general entropic distributions
- Hardness of SIS and LWE with small parameters
- Homomorphic encryption for arithmetic of approximate numbers
- Large FHE gates from tensored homomorphic accumulator
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- Multi-key homomorphic encryption from TFHE
- Multiparty computation with low communication, computation and interaction via threshold FHE
- New Algorithms for Learning in Presence of Errors
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the hardness of learning with errors with binary secrets
- Revisiting homomorphic encryption schemes for finite fields
- Ring packing and amortized FHEW bootstrapping
- Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems
- TFHE: fast fully homomorphic encryption over the torus
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Two round multiparty computation via multi-key FHE
Cited in
(9)- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- Fast blind rotation for bootstrapping FHEs
- Circuit bootstrapping: faster and smaller
- Improved bootstrapping for approximate homomorphic encryption
- FHEW with Efficient Multibit Bootstrapping
- Revisiting key switching techniques with applications to light-key FHE
- Threshold fully homomorphic encryption over the torus
This page was built for publication: Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085271)
