SHARP: A Short-Word Hierarchical Accelerator for Robust and Practical Fully Homomorphic Encryption
Top Cited Papers
Open Access
- 17 June 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-15
Abstract
Fully homomorphic encryption (FHE) is an emerging cryptographic technology that guarantees the privacy of sensitive user data by enabling direct computations on encrypted data. Despite the security benefits of this approach, FHE is associated with prohibitively high levels of computational and memory overhead, preventing its widespread use in real-world services. Numerous domain-specific hardware designs have been proposed to address this issue, but most of them use excessive amounts of chip area and power, leaving room for further improvements in terms of practicality. We propose SHARP, a robust and practical accelerator for FHE. We analyze the implications of various hardware design choices on the functionality, performance, and efficiency of FHE. We conduct a multifaceted analysis of the impacts of the machine word length choice on the FHE acceleration, which, despite its importance with regard to hardware efficiency, has yet to be explored due to its complex correlation with various FHE parameters. A relatively short word length of 36 bits is discovered to be a robust and efficient solution for FHE accelerators. We devise an efficient hierarchical SHARP microarchitecture with a novel data organization and specialized functional units and substantially reduce the on-chip memory capacity requirement through architectural and software enhancements. This study demonstrates that SHARP delivers superior performance over prior FHE accelerators with a distinctly smaller chip area and lower power budget.Keywords
Funding Information
- IITP (2021-0-01343)
- Samsung Electronics Co. (IO201207-07812-01)
This publication has 84 references indexed in Scilit:
- Everything as a Service (XaaS) on the Cloud: Origins, Current and Future Trends2015
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second2015
- FinCACTI: Architectural Analysis and Modeling of Caches with Deeply-Scaled FinFET Devices2014
- (Leveled) Fully Homomorphic Encryption without BootstrappingACM Transactions on Computation Theory, 2014
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$SIAM Journal on Computing, 2014
- On Ideal Lattices and Learning with Errors over Rings2010
- The future of wiresProceedings of the IEEE, 2001
- Transport-triggering vs. operation-triggering1994
- Modular multiplication without trial divisionMathematics of Computation, 1985
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965