With the rapid development of AI technology, we have witnessed numerous innovations and conveniences. However, along with these advancements come privacy threats and risks. Fully Homomorphic Encryption (FHE) emerges as a key technology for privacy-preserving computation, enabling computations while maintaining data privacy. Nevertheless, FHE has limitations in processing continuous non-polynomial functions as it is restricted to discrete integers and supports only addition and multiplication. Spiking Neural Networks (SNNs) operate on discrete spike signals, naturally aligning with the properties of FHE. In this paper, we present a framework called FHE-DiCSNN. This framework is based on the efficient TFHE scheme and leverages the discrete properties of SNNs to achieve high prediction performance on ciphertexts. Firstly, by employing bootstrapping techniques, we successfully implement computations of the Leaky Integrate-and-Fire neuron model on ciphertexts. Through bootstrapping, we can facilitate computations for SNNs of arbitrary depth. This framework can be extended to other spiking neuron models, providing a novel framework for the homomorphic evaluation of SNNs. Secondly, inspired by CNNs, we adopt convolutional methods to replace Poisson encoding. This not only enhances accuracy but also mitigates the issue of prolonged simulation time caused by random encoding. Furthermore, we employ engineering techniques to parallelize the computation of bootstrapping, resulting in a significant improvement in computational efficiency. Finally, we evaluate our model on the MNIST dataset. Experimental results demonstrate that, with the optimal parameter configuration, FHE-DiCSNN achieves an accuracy of 97.94% on ciphertexts, with a loss of only 0.53% compared to the original network's accuracy of 98.47%. Moreover, each prediction requires only 0.75 seconds of computation time
Efficient Encrypted Computation in Convolutional Spiking Neural Networks with TFHE
School of Cyber Science and Engineering, Huazhong University of Science and Technology(华中科技大学网络空间安全学院);School of Mathematics and Statistics, Huazhong University of Science and Technology(华中科技大学数学与统计学院);Center for Mathematical Science, Huazhong University of Science and Technology(华中科技大学数学中心);Steklov-Wuhan Institute for Mathematical Exploration, Huazhong University of Science and Technology(华中科技大学斯捷克洛夫-武汉数学探索研究所);Department of Mathematics and Department of Physics, Great Bay University(大湾区大学数学与物理学院);Guangdong Provincial Key Laboratory of Mathematical and Neural Dynamical Systems(广东省数学与神经动力系统重点实验室)
On the Vulnerability of FHE Computation to Silent Data Corruption
Institute of Computing Technology Chinese Academy of Sciences Beijing China;School of Advanced Interdisciplinary Sciences University of Chinese Academy of Sciences Beijing China;School of Cyber Science;Technology Beihang University Beijing China;Institute of Computing Technology;Chinese Academy of Sciences;School of Advanced Interdisciplinary Sciences;University of Chinese Academy of Sciences;Beihang University
Preserving Data Privacy in Learning Causal Structure with Fully Homomorphic Encryption
Hong Kong University of Science and Technology (Guangzhou)(香港理工大学(广州));Hong Kong University of Science and Technology(香港理工大学);University of California, Berkeley(加州大学伯克利分校)
Scaling up FHE-based Privacy-Preserving ML: Higher Throughput, Longer Inputs for LLama-3-8B
Graduate School of Convergence Science and Technology, Seoul National University(首尔大学融合科学技术研究生院);CryptoLab, Inc.(CryptoLab公司);Department of Mathematics, Seoul National University(首尔大学数学系)
Privacy-Preserving Product-Quantized Approximate Nearest Neighbor Search Framework for Large-scale Datasets via A Hybrid of Fully Homomorphic Encryption and Trusted Execution Environment
Latency-Optimal Adaptive Split Inference for Privacy-Preserving Cloud-Edge-End Collaboration
Guangdong Provincial Key Laboratory of Intelligent Information Processing, College of Electronics and Information Engineering, Shenzhen University(深圳大学电子与信息工程学院);The Hong Kong Polytechnic University(香港理工大学)
Detecting and Understanding Vulnerabilities in Fully Homomorphic Encryption Frameworks
The Hong Kong University of Science(香港科学与技术大学);State Key Laboratory of Novel Software Technology, Nanjing University(南京大学新型软件技术国家重点实验室);Nara Institute of Science(奈良科学研究院)
SoK: Can Fully Homomorphic Encryption Support General AI Computation? A Functional and Cost Analysis
University of Central Florida(中佛罗里达大学);University of Florida(佛罗里达大学);Illinois Institute of Technology(伊利诺伊理工学院);Florida State University(佛罗里达州立大学);The University of Kansas(堪萨斯大学);Samsung Research America(三星美国研究所);Villanova University(维拉诺瓦大学);University of Arizona(亚利桑那大学)
MQFL-FHE: Multimodal Quantum Federated Learning Framework with Fully Homomorphic Encryption
SVKM's Dwarkadas J. Sanghvi College of Engineering(SVKM的达沃拉德·J·桑格维工程学院);eBRAIN Lab, Division of Engineering, New York University Abu Dhabi (NYUAD)(eBRAIN实验室,工程系,纽约大学阿布扎比分校(NYUAD));Center for Quantum and Topological Systems (CQTS), NYUAD Research Institute(量子与拓扑系统中心(CQTS),NYUAD研究机构);The Maersk Mc-Kinney Moller Institute, University of Southern Denmark(马士克·麦克金尼·莫勒研究所,南丹麦大学);Corvinus Institute for Advanced Studies (CIAS), Budapest, Hungary(科维努斯高级研究学院(CIAS),布达佩斯,匈牙利);Davidson School of Chemical Engineering, Purdue University(戴维森化学工程学院,普渡大学)