Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
From MaRDI portal
Publication:6085271
DOI10.1007/978-3-031-30620-4_8zbMATH Open1528.94065MaRDI QIDQ6085271FDOQ6085271
Authors: Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo 
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Recommendations
bootstrappingautomorphismfully homomorphic encryption (FHE)threshold homomorphic encryptionblind rotation
Cites Work
- Faster homomorphic linear transformations in HElib
- TFHE: fast fully homomorphic encryption over the torus
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- (Leveled) fully homomorphic encryption without bootstrapping
- New Algorithms for Learning in Presence of Errors
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On the concrete hardness of learning with errors
- Hardness of LWE on general entropic distributions
- FHEW: bootstrapping homomorphic encryption in less than a second
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- On the hardness of learning with errors with binary secrets
- Homomorphic encryption for arithmetic of approximate numbers
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Revisiting homomorphic encryption schemes for finite fields
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Multi-key FHE from LWE, revisited
- Multi-identity and multi-key leveled FHE from learning with errors
- Two round multiparty computation via multi-key FHE
- Hardness of SIS and LWE with small parameters
- Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems
- Large FHE gates from tensored homomorphic accumulator
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Faster Bootstrapping with Polynomial Error
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Ring packing and amortized FHEW bootstrapping
- FINAL: faster FHE instantiated with NTRU and LWE
- Multi-key homomorphic encryption from TFHE
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
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)
