Proceedings Article10.1109/HPEC.2012.6408660
Accelerating fully homomorphic encryption using GPU
Wei Wang,Yin Hu,Lianmu Chen,Xinming Huang,Berk Sunar +4 more
- 01 Sep 2012
- pp 1-5
149
TL;DR: The GH-FHE primitives for the small setting with a dimension of 2048 on NVIDIA C2050 GPU are implemented and the experimental results show the speedup factors of 7.68, 7.4 and 6.59 for encryption, decryption and recrypt respectively, when compared with the existing CPU implementation.
read more
Abstract: As a major breakthrough, in 2009 Gentry introduced the first plausible construction of a fully homomorphic encryption (FHE) scheme FHE allows the evaluation of arbitrary functions directly on encrypted data on untwisted servers In 2010, Gentry and Halevi presented the first FHE implementation on an IBM x3500 server However, this implementation remains impractical due to the high latency of encryption and recryption The Gentry-Halevi (GH) FHE primitives utilize multi-million-bit modular multiplications and additions which are time-consuming tasks for a general purpose computer In the GH-FHE implementation, the most computationally intensive arithmetic operation is modular multiplication In this paper, the million-bit modular multiplication is computed in two steps For large number multiplication, Strassen's FFT based algorithm is employed and accelerated on a graphics processing unit (GPU) through its massive parallelism Subsequently, Barrett modular reduction algorithm is applied to implement modular reduction As an experimental study, we implement the GH-FHE primitives for the small setting with a dimension of 2048 on NVIDIA C2050 GPU The experimental results show the speedup factors of 768, 74 and 659 for encryption, decryption and recrypt respectively, when compared with the existing CPU implementation
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 framework for secure and decentralized sharing of medical imaging data via blockchain consensus
TL;DR: This work develops a framework for cross-domain image sharing that uses a blockchain as a distributed data store to establish a ledger of radiological studies and patient-defined access permissions and readily generalize to domains beyond medical imaging.
371
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.
A resource-efficient encryption algorithm for multimedia big data
TL;DR: The developed encryption algorithm has higher Avalanche Effect and for instance, AES in the proposed system has an Avalanche Effect of %52.50, therefore, such system is able to secure the multimedia big data against real-time attacks.
190
•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
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
Modular multiplication without trial division
TL;DR: A method for multiplying two integers modulo N while avoiding division by N, a representation of residue classes so as to speed modular multiplication without affecting the modular addition and subtraction algorithms.
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.
Implementing Gentry's fully-homomorphic encryption scheme
Craig Gentry,Shai Halevi +1 more
- 15 May 2011
TL;DR: In this article, the authors describe a working implementation of a variant of Gentry's fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010).
Related Papers (5)
Craig Gentry
- 31 May 2009
Craig Gentry,Shai Halevi +1 more
- 15 May 2011
Dan Boneh,Craig Gentry +1 more
- 01 Jan 2009
Zvika Brakerski,Vinod Vaikuntanathan +1 more
- 22 Oct 2011