FHEW with Efficient Multibit Bootstrapping
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 pe...
Saved in:
Published in | Progress in Cryptology -- LATINCRYPT 2015 pp. 119 - 135 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Cham
Springer International Publishing
2015
|
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISBN: | 9783319221731 3319221736 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-319-22174-8_7 |