FHEW with Efficient Multibit Bootstrapping

Conference paper

DOI: 10.1007/978-3-319-22174-8_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9230)
Cite this paper as:
Biasse JF., Ruiz L. (2015) FHEW with Efficient Multibit Bootstrapping. In: Lauter K., Rodríguez-Henríquez F. (eds) Progress in Cryptology -- LATINCRYPT 2015. LATINCRYPT 2015. Lecture Notes in Computer Science, vol 9230. Springer, Cham


In this paper, we describe a generalization of the fully homomorphic encryption scheme FHEW described by Ducas and Micciancio [8]. It is characterized by an efficient bootstrapping procedure performed after each gate, as opposed to the HElib of Halevi and Shoup that handles batches of encryptions periodically. While the Ducas-Micciancio scheme was limited to NAND gates, we propose a generalization that can handle arbitrary gates for only one call to the bootstrapping procedure. We also show how bootstrapping can be parallelized and address its performances in a multicore environment.


Fully homomorphic encryption LWE Bootstrapping Parallelization 

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Combinatorics and OptimizationUniversity of WaterlooWaterlooCanada

Personalised recommendations