Practical Solutions in Fully Homomorphic Encryption -- A Survey Analyzing Existing Acceleration Methods
Authors:
- Yanwei GongYGYanwei Gong
- Xiaolin ChangXCXiaolin Chang
- Jelena MišićJMJelena Mišić
- Vojislav B. MišićVMVojislav B. Mišić
- Jianhua WangJWJianhua Wang
- Haoran ZhuHZHaoran Zhu
Preprint
Abstract
Fully homomorphic encryption (FHE) has experienced significant development and continuous breakthroughs in theory, enabling its widespread application in various fields, like outsourcing computation and secure multi-party computing, in order to preserve privacy. Nonetheless, the application of FHE is constrained by its substantial computing overhead and storage cost. Researchers have proposed practical acceleration solutions to address these issues. This paper aims to provide a comprehensive survey for systematically comparing and analyzing the strengths and weaknesses of FHE acceleration schemes, which is currently lacking in the literature. The relevant researches conducted between 2019 and 2022 are investigated. We first provide a comprehensive summary of the latest research findings on accelerating FHE, aiming to offer valuable insights for researchers interested in FHE acceleration. Secondly, we classify existing acceleration schemes from algorithmic and hardware perspectives. We also propose evaluation metrics and conduct a detailed comparison of various methods. Finally, our study presents the future research directions of FHE acceleration, and also offers both guidance and support for practical application and theoretical research in this field.Keywords
All Related Versions
This publication has 44 references indexed in Scilit:
- Bootstrapping for Approximate Homomorphic Encryption with Negligible Failure-Probability by Using Sparse-Secret Encapsulation2022
- Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys2021
- Better Bootstrapping for Approximate Homomorphic Encryption2020
- Faster Homomorphic Linear Transformations in HElib2018
- Fast Homomorphic Evaluation of Deep Discretized Neural Networks2018
- A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes2017
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme2011
- Fully Homomorphic Encryption over the Integers2010
- Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor2000
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes1999