Full domain functional bootstrapping with least significant bit encoding
From MaRDI portal
Publication:6573662
Recommendations
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- Integerwise Functional Bootstrapping on TFHE
- \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Batched fully homomorphic encryption from TFHE
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Algorithms in HElib
- Bootstrapping for approximate homomorphic encryption
- Bootstrapping for helib
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- New techniques for multi-value input homomorphic evaluation and applications
- On lattices, learning with errors, random linear codes, and cryptography
- Practical bootstrapping in quasilinear time
- Revisiting homomorphic encryption schemes for finite fields
- TFHE: fast fully homomorphic encryption over the torus
Cited in
(2)
This page was built for publication: Full domain functional bootstrapping with least significant bit encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573662)
