Efficient Privacy-Preserving Machine Learning with Homomorphic Encryption through Pruning

Homomorphic encryption (HE) is an important and promising technology in privacy-preserving machine learning (PPML), which can perform calculations without decrypting data to ensure data privacy. It is widely applied in PPML. However, HE incurs extremely high computational costs, particularly for rotation and multiplication operations, which are far more expensive than plaintext computations. This paper proposes a HE-based weight pruning convolutional neural network (CNN) model — PrHECNN. By pruning convolutional kernels and global weights, PrHECNN effectively reduces the number of rotation and multiplication operations, significantly lowering computational and memory costs, and providing efficient and accurate inference for PPML. Experiments on the MNIST dataset show that PrHECNN improves the encrypted inference speed by 17.33%-74.23% and reduces memory usage by 36.67%-87.72%, showing the best performance among all compared methods. Additionally, the model achieves an accuracy of 98.55%, nearly identical to the plaintext model.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/icaibd64986.2025.11081983
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Privacy-Preserving Machine Learning with Homomorphic Encryption through Pruning

Kaiqiong Chen, Yating Zheng, Yaorong Lin, Yiqin Lu et al.
Cryptography and Data Security
article

Efficient Privacy-Preserving Machine Learning with Homomorphic Encryption through Pruning

Kaiqiong Chen, Yating Zheng, Yaorong Lin, Yiqin Lu, Jiarui Chen, Jiancheng Qin
article en

Abstract

Homomorphic encryption (HE) is an important and promising technology in privacy-preserving machine learning (PPML), which can perform calculations without decrypting data to ensure data privacy. It is widely applied in PPML. However, HE incurs extremely high computational costs, particularly for rotation and multiplication operations, which are far more expensive than plaintext computations. This paper proposes a HE-based weight pruning convolutional neural network (CNN) model — PrHECNN. By pruning convolutional kernels and global weights, PrHECNN effectively reduces the number of rotation and multiplication operations, significantly lowering computational and memory costs, and providing efficient and accurate inference for PPML. Experiments on the MNIST dataset show that PrHECNN improves the encrypted inference speed by 17.33%-74.23% and reduces memory usage by 36.67%-87.72%, showing the best performance among all compared methods. Additionally, the model achieves an accuracy of 98.55%, nearly identical to the plaintext model.

South China University of Technology (CN)
Openalex Percentile: Top 91%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Efficient Privacy-Preserving Machine Learning with Homomorphic Encryption through Pruning — Kaiqiong Chen, Yating Zheng, et al. · (2025) | TGRS Research Map | TGRS