CryptoDB
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
| Authors: |
|
|---|---|
| Download: | |
| Presentation: | Slides |
| 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 paper 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. Numerous examples are provided to illustrate the various concepts and definitions. |
BibTeX
@article{tches-2022-32381,
title={SoK: Fully Homomorphic Encryption over the [Discretized] Torus},
journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},
publisher={Ruhr-Universität Bochum},
volume={2022, Issue 4},
pages={661-692},
url={https://tches.iacr.org/index.php/TCHES/article/view/9836},
doi={10.46586/tches.v2022.i4.661-692},
author={Marc Joye},
year=2022
}