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_8zbMath1528.94065MaRDI QIDQ6085271
Andrey Kim, Yongwoo Lee, Daniele Micciancio, Rakyong Choi, Jieun Eom, Maxim Deryabin, Donghoon Yoo
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
automorphismbootstrappingfully homomorphic encryption (FHE)threshold homomorphic encryptionblind rotation
Related Items (1)
Cites Work
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- On the concrete hardness of learning with errors
- Large FHE gates from tensored homomorphic accumulator
- Faster homomorphic linear transformations in HElib
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Hardness of LWE on general entropic distributions
- Multi-key homomorphic encryption from TFHE
- TFHE: fast fully homomorphic encryption over the torus
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
- Hardness of SIS and LWE with Small Parameters
- Faster Bootstrapping with Polynomial Error
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- New Algorithms for Learning in Presence of Errors
- Multi-key FHE from LWE, Revisited
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- On Ideal Lattices and Learning with Errors over Rings
- Ring Packing and Amortized FHEW Bootstrapping
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Classical hardness of learning with errors
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- FINAL: faster FHE instantiated with NTRU and LWE
- Revisiting homomorphic encryption schemes for finite fields
This page was built for publication: Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
