Threshold fully homomorphic encryption over the torus
From MaRDI portal
Publication:6550610
DOI10.1007/978-3-031-50594-2_3MaRDI QIDQ6550610
Kengo Mori, Takuya Hayashi, Toshiyuki Isshiki, Yukimasa Sugizaki, Akira Nakashima, Hikaru Tsuchida, Koji Nuida
Publication date: 5 June 2024
secret-sharing schememultiparty computationclient-aided modelCGGIthreshold fully homomorphic encryption
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the concrete hardness of learning with errors
- Threshold cryptosystems from threshold fully homomorphic encryption
- Constant-round client-aided secure comparison protocol
- Multi-key homomorphic encryption from TFHE
- Communication-efficient (client-aided) secure two-party protocols and its application
- TFHE: fast fully homomorphic encryption over the torus
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- Efficient oblivious transfer protocols
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Information-Theoretically Secure Protocols and Security under Composition
- Fully homomorphic encryption using ideal lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- FINAL: faster FHE instantiated with NTRU and LWE
This page was built for publication: Threshold fully homomorphic encryption over the torus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550610)
