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.
Type de document :
Pré-publication, Document de travail
2015
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01181319
Contributeur : Vialla Bastien <>
Soumis le : mercredi 29 juillet 2015 - 20:57:38
Dernière modification le : jeudi 24 mai 2018 - 15:59:23
Document(s) archivé(s) le : vendredi 30 octobre 2015 - 10:33:15

Fichier

SAC2015.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01181319, version 1

Collections

Relations

Citation

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

Partager

Métriques

Consultations de la notice

432

Téléchargements de fichiers

180