Accelerating TFHE with sorted bootstrapping techniques
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Discretization error reduction for high precision torus fully homomorphic encryption
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fast homomorphic evaluation of deep discretized neural networks
- Faster Bootstrapping with Polynomial Error
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Lattice-based Cryptography
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the security of homomorphic encryption on approximate numbers
- Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems
- TFHE: fast fully homomorphic encryption over the torus
- Worst-case to average-case reductions for module lattices
This page was built for publication: Accelerating TFHE with sorted bootstrapping techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232711)
