[Resource Topic] 2017/996: Large FHE gates from Tensored Homomorphic Accumulator

Welcome to the resource topic for 2017/996

Large FHE gates from Tensored Homomorphic Accumulator

Authors: Guillaume Bonnoron, Léo Ducas, Max Fillinger


The main bottleneck of all known Fully Homomorphic Encryption schemes lies in the bootstrapping procedure invented by Gentry (STOC’09). The cost of this procedure can be mitigated either using Homomorphic SIMD techniques, or by performing larger computation per bootstrapping procedure. In this work, we propose new techniques allowing to perform more operations per bootstrapping in FHEW-type schemes (EUROCRYPT’13). While maintaining the quasi-quadratic \tilde O(n^2) complexity of the whole cycle, our new scheme allows to evaluate gates with \Omega(\log n) input bits, which constitutes a quasi-linear speed-up. Our scheme is also very well adapted to large threshold gates, natively admitting up to \Omega(n) inputs. This could be helpful for homomorphic evaluation of neural networks. Our theoretical contribution is backed by a preliminary prototype implementation, which can perform 6-to-6 bit gates in less than 10 seconds on a single core, as well as threshold gates over 63 input bits even faster.

ePrint: https://eprint.iacr.org/2017/996

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 .