Paper 2021/1402
Guide to Fully Homomorphic Encryption over the [Discretized] Torus
Abstract
First posed as a challenge in 1978 by Rivest et al., fully homomorphic encryption—the ability to evaluate any function over encrypted data— was only solved in 2009 in a breakthrough result by Gentry (Commun. ACM, 2010). After a decade of intense research, practical solutions have emerged and are being pushed for standardization. This guide is intended to practitioners. It explains the inner-workings of TFHE, a torus-based fully homomorphic encryption scheme. More exactly, it describes its implementation on a discretized version of the torus. It also explains in detail the technique of the programmable bootstrapping.
Note: Introduction and more PBS techniques added
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- A minor revision of an IACR publication in TCHES 2022
- Keywords
- Fully homomorphic encryption Discretized torus TFHE Programmable bootstrapping Implementation
- Contact author(s)
- marc @ zama ai
- History
- 2022-08-07: revised
- 2021-10-18: received
- See all versions
- Short URL
- https://ia.cr/2021/1402
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1402,
author = {Marc Joye},
title = {Guide to Fully Homomorphic Encryption over the [Discretized] Torus},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1402},
year = {2021},
url = {https://eprint.iacr.org/2021/1402}
}
