Paper 2021/1402

Guide to Fully Homomorphic Encryption over the [Discretized] Torus

Marc Joye

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. 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.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. Minor revision.
Keywords
FHETFHELWEDiscretized torusProgrammable bootstrapping
Contact author(s)
marc @ zama ai
History
2021-10-18: received
Short URL
https://ia.cr/2021/1402
License
Creative Commons Attribution
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},
      note = {\url{https://eprint.iacr.org/2021/1402}},
      url = {https://eprint.iacr.org/2021/1402}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.