Journal Article10.1109/TC.2014.2345388
Accelerating Fully Homomorphic Encryption in Hardware
125
TL;DR: This contribution presents the first full realization of FHE in hardware based on the Gentry-Halevi fully homomorphic encryption scheme using an optimized multi-million bit multiplierbased on the Schonhage Strassen multiplication algorithm.
read more
Abstract: We present a custom architecture for realizing the Gentry-Halevi fully homomorphic encryption (FHE) scheme. This contribution presents the first full realization of FHE in hardware. The architecture features an optimized multi-million bit multiplier based on the Schonhage Strassen multiplication algorithm. Moreover, a number of optimizations including spectral techniques as well as a precomputation strategy is used to significantly improve the performance of the overall design. When synthesized using 90 nm technology, the presented architecture achieves to realize the encryption, decryption, and recryption operations in 18.1 msec, 16.1 msec, and 3.1 sec, respectively, and occupies a footprint of less than 30 million gates.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
TL;DR: The basics of HE and the details of the well-known Partially Homomorphic Encryption and Somewhat Homomorphic encryption schemes, which are important pillars for achieving FHE, are presented and the implementations and recent improvements in Gentry-type FHE schemes are surveyed.
865
•Posted Content
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
TL;DR: The basics of HE and the details of the well-known Partially Homomorphic Encryption and Somewhat HomomorphicEncryption, which are important pillars of achieving FHE, are presented and the main FHE families, which have become the base for the other follow-up FHE schemes are presented.
765
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption
Nikola Samardzic,Axel Feldmann,Aleksandar Krastev,Srinivas Devadas,Ronald G. Dreslinski,Chris Peikert,Daniel Sanchez +6 more
- 18 Oct 2021
TL;DR: F1 as discussed by the authors is the first FHE accelerator that is programmable, i.e., capable of executing full FHE programs, based on an in-depth architectural analysis of the characteristics of FHE computations that reveals acceleration opportunities.
•Posted Content
HEAX: An Architecture for Computing on Encrypted Data
TL;DR: HEAX is presented, a novel hardware architecture for FHE that achieves unprecedented performance improvements and a new highly-parallelizable architecture for number-theoretic transform (NTT) which can be of independent interest as NTT is frequently used in many lattice-based cryptography systems.
172
A Survey on Fully Homomorphic Encryption: An Engineering Perspective
TL;DR: In this survey, both previous and current Somewhat Homomorphic Encryption schemes are reviewed, and the more powerful and recent Fully HomomorphicEncryption (FHE) schemes are comprehensively studied.
165
References
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Fully homomorphic encryption using ideal lattices
Craig Gentry
- 31 May 2009
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
A fully homomorphic encryption scheme
Dan Boneh,Craig Gentry +1 more
- 01 Jan 2009
TL;DR: This work designs a somewhat homomorphic "boostrappable" encryption scheme that works when the function f is the scheme's own decryption function, and shows how, through recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption.
3K
Leveled) fully homomorphic encryption without bootstrapping
Zvika Brakerski,Craig Gentry,Vinod Vaikuntanathan +2 more
- 08 Jan 2012
TL;DR: A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011).
On data banks and privacy homomorphisms
Ronald L. Rivest,Michael L. Dertouzos +1 more
- 01 Jan 1978
TL;DR: It appears likely that there exist encryption functions which permit encrypted data to be operated on without preliminary decryption of the operands, for many sets of interesting operations.
Related Papers (5)
Dan Boneh,Craig Gentry +1 more
- 01 Jan 2009
Craig Gentry
- 31 May 2009
Craig Gentry,Shai Halevi,Nigel P. Smart +2 more
- 19 Aug 2012
Craig Gentry,Shai Halevi +1 more
- 15 May 2011