TFHE public-key encryption revisited
From MaRDI portal
Publication:6636115
DOI10.1007/978-3-031-58868-6_11MaRDI QIDQ6636115
Publication date: 12 November 2024
public-key encryptionlearning with errors (LWE)fully homomorphic encryption (FHE)ring LWE (RLWE)TFHE cryptosystem
Cites Work
- Probabilistic encryption
- On the ring-LWE and polynomial-LWE problems
- Algebraically structured LWE. Revisited
- TFHE: fast fully homomorphic encryption over the torus
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Homomorphic Encryption: From Private-Key to Public-Key
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Randomness Re-use in Multi-recipient Encryption Schemeas
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: TFHE public-key encryption revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636115)