Recommendations
- Fully homomorphic encryption scheme based on public key compression and batch processing
- An overview of torus fully homomorphic encryption
- scientific article; zbMATH DE number 6672298
- Faster homomorphic encryption over GPGPUs via hierarchical DGT
- Efficient fully homomorphic encryption from (standard) LWE
Cites work
- Algebraically structured LWE. Revisited
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- 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
- On ideal lattices and learning with errors over rings
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the ring-LWE and polynomial-LWE problems
- Probabilistic encryption
- Randomness Re-use in Multi-recipient Encryption Schemeas
- TFHE: fast fully homomorphic encryption over the torus
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(5)- Secure outsourced matrix multiplication with fully homomorphic encryption
- An overview of torus fully homomorphic encryption
- Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
- Drifting towards better error probabilities in fully homomorphic encryption schemes
- Error-simulatable sanitization for TFHE and applications
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)
