Paper 2022/1177
Liberating TFHE: Programmable Bootstrapping with General Quotient Polynomials
Abstract
All known instantiations for fully homomorphic encryption (FHE) produce noisy ciphertexts and rely on a technique called bootstrapping to reduce the noise so as to enable an arbitrary number of homomorphic operations. Bootstrapping is the main performance bottleneck and arguably the biggest obstacle to widespread adoption of FHE. Among the FHE schemes, TFHE and its variations present the appealing property of having a bootstrapping procedure---as well as its extension to programmable bootstrapping---that is relatively light-weight. The essential operations consist of a series of multiplications in
Note: Added more detailed analysis on noise growth.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. WAHC 2022
- DOI
- 10.1145/3560827.3563376
- Keywords
- Number-theoretic transformPolynomial multiplicationBlind rotationFHEProgrammable bootstrapping
- Contact author(s)
-
marc @ zama ai
michael walter @ zama ai - History
- 2023-02-17: revised
- 2022-09-08: received
- See all versions
- Short URL
- https://ia.cr/2022/1177
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1177, author = {Marc Joye and Michael Walter}, title = {Liberating {TFHE}: Programmable Bootstrapping with General Quotient Polynomials}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1177}, year = {2022}, doi = {10.1145/3560827.3563376}, url = {https://eprint.iacr.org/2022/1177} }