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 :
Communication dans un congrès
SAC: Selected Areas in Cryptography, Aug 2015, Sackville, NB, Canada. Revised Selected Papers of thé 22nd International Conference on Selected Areas in Cryptography, LNCS (9566), pp.25-43, 2015, 〈10.1007/978-3-319-31301-6_2〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01371764
Contributeur : Laurent Imbert <>
Soumis le : lundi 26 septembre 2016 - 14:29:20
Dernière modification le : jeudi 24 mai 2018 - 15:59:24

Lien texte intégral

Identifiants

Collections

Relations

Citation

Marie Paindavoine, Bastien Vialla. Minimizing the number of bootstrappings in fully homomorphic encryption. SAC: Selected Areas in Cryptography, Aug 2015, Sackville, NB, Canada. Revised Selected Papers of thé 22nd International Conference on Selected Areas in Cryptography, LNCS (9566), pp.25-43, 2015, 〈10.1007/978-3-319-31301-6_2〉. 〈lirmm-01371764〉

Partager

Métriques

Consultations de la notice

89