Practical solutions in fully homomorphic encryption:a survey analyzing existing acceleration methods  

作　　者：Yanwei Gong Xiaolin Chang Jelena Mišić Vojislav BMišić Jianhua Wang Haoran Zhu 

机构地区：[1]Beijing Key Laboratory of Security and Privacy in Intelligent Transportation,Beijing Jiaotong University,Beijing,China [2]Ryerson University,Toronto,ON,Canada

出　　处：《Cybersecurity》2025年第1期22-44,共23页网络空间安全科学与技术(英文)

基　　金：supported in part by National Natural Science Foundation of China under Grant No.62272028 and 6230203.

摘　　要：Fully homomorphic encryption(FHE)has experienced signifcant development and continuous breakthroughs in theory,enabling its widespread application in various felds,like outsourcing computation and secure multiparty 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 frst provide a comprehensive summary of the latest research fndings on accelerating FHE,aiming to ofer 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 ofers both guidance and support for practical application and theoretical research in this feld.

关 键 词：ACCELERATION BOOTSTRAPPING FPGA Fully homomorphic encryption GPU NTT 

分 类 号：O41[理学—理论物理]