UPDF AI
New Chat
Search History
Scholar ResearchPaper SearchLibrary
Chats
UPDF AI

FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

L. Ducas,Daniele Micciancio

2015 · DOI: 10.1007/978-3-662-46800-5_24
International Conference on the Theory and Application of Cryptographic Techniques · 937 Citations

TLDR

A new method to homomorphically compute simple bit operations, and refresh (bootstrap) the resulting output, which runs on a personal computer in just about half a second, and is presented on the performance of the prototype implementation.

Abstract

The main bottleneck affecting the efficiency of all known fully homomorphic encryption (FHE) schemes is Gentry’s bootstrapping procedure, which is required to refresh noisy ciphertexts and keep computing on encrypted data. Bootstrapping in the latest implementation of FHE, the HElib library of Halevi and Shoup (Crypto 2014), requires about six minutes. We present a new method to homomorphically compute simple bit operations, and refresh (bootstrap) the resulting output, which runs on a personal computer in just about half a second. We present a detailed technical analysis of the scheme (based on the worst-case hardness of standard lattice problems) and report on the performance of our prototype implementation.