HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption

Marie Paindavoine 1, 2 Bastien Vialla 3
3 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : There has been great progress regarding efficient implementations of fully homomorphic encryption schemes since the first construction by Gentry. However, evaluating complex circuits is still undermined by the necessary resort to the bootstrapping procedure. Minimizing the number of times such procedure is called is a simple yet very efficient way to critically improve performances of homomorphic evaluations. To tackle this problem, a first solution has been proposed in 2013 by Lepoint and Paillier, using boolean satisfiability. But their method cannot handle the versatility of fully homomorphic encryption schemes. In this paper, we go one step forward providing two main contributions. First, we prove that the problem of minimizing bootstrapping is NP-complete with a reduction from a graph problem. Second, we propose a flexible technique that permits to determine both such minimal number of bootstrappings and where to place them in the circuit. Our method is mainly based on linear programming. Our result can advantageously be applied to existing constructions. As an example, we show that for the Smart-Tillich AES circuit, published on the Internet in 2012, we find about 70% less bootstrappings than naive methods.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

Contributor : Vialla Bastien Connect in order to contact the contributor
Submitted on : Wednesday, July 29, 2015 - 8:57:38 PM
Last modification on : Tuesday, March 15, 2022 - 12:55:39 PM
Long-term archiving on: : Friday, October 30, 2015 - 10:33:15 AM


Files produced by the author(s)


  • HAL Id : hal-01181319, version 1



Marie Paindavoine, Bastien Vialla. Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption. 2015. ⟨hal-01181319⟩



Record views


Files downloads