[Resource Topic] 2020/995: Bootstrapping fully homomorphic encryption over the integers in less than one second

Welcome to the resource topic for 2020/995

Title:
Bootstrapping fully homomorphic encryption over the integers in less than one second

Authors: Hilder Vitor Lima Pereira

Abstract:

One can bootstrap LWE-based fully homomorphic encryption (FHE) schemes in less than one second, but bootstrapping AGCD-based FHE schemes, also known as FHE over the integers, is still very slow. In this work we propose a fast bootstrapping method for FHE over the integers, closing thus this gap between these two types of schemes. We use a variant of the AGCD problem to construct a new GSW-like scheme that can natively encrypt polynomials, then, we show how the single-gate bootstrapping method proposed by Ducas and Micciancio (EUROCRYPT 2015) can be adapted to FHE over the integers using our scheme, and we implement a bootstrapping that, using around 400 MB of key material, runs in less than one second in a common personal computer.

ePrint: https://eprint.iacr.org/2020/995

Talk: https://www.youtube.com/watch?v=7GHtgg3rsBg

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .