Practical randomized lattice gadget decomposition with application to FHE
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- -subgaussian random variables in cryptography
- A toolkit for ring-LWE cryptography
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- FHE circuit privacy almost for free
- FHEW: bootstrapping homomorphic encryption in less than a second
- FINAL: faster FHE instantiated with NTRU and LWE
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- SHECS-PIR: Somewhat Homomorphic Encryption-Based Compact and Scalable Private Information Retrieval
- TFHE: fast fully homomorphic encryption over the torus
- Towards a simpler lattice gadget toolkit
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Type 2 structure-preserving signature schemes revisited
This page was built for publication: Practical randomized lattice gadget decomposition with application to FHE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550632)
