Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
From MaRDI portal
Publication:6635903
DOI10.1007/978-3-031-57728-4_12MaRDI QIDQ6635903
Hyesun Kwak, Seonhong Min, Yongsoo Song
Publication date: 12 November 2024
Cites Work
- (Leveled) fully homomorphic encryption without bootstrapping
- Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
- On multiparty garbling of arithmetic circuits
- Multi-key homomorphic encryption from TFHE
- Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- 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
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Multi-key FHE from LWE, Revisited
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Fully homomorphic encryption using ideal lattices
- On Ideal Lattices and Learning with Errors over Rings
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
This page was built for publication: Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635903)
