Broad Learning Inference Based on Fully Homomorphic Encryption

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Distributed big data computing environments such as machine learning are widely deployed and applied on the cloud. However, since cloud servers can easily access user data, it leads to serious data leakage problems. As a potential technology, Fully Homomorphic Encryption (FHE) is often used in the field of privacy-preserving machine learning. However, in order to reduce the multiplicative depth of FHE, the neural network prunes the number of network layers, resulting in low inference accuracy. A learning model named Broad Learning System (BLS) has the characteristics of shallow model depth and low complexity. Based on this mode, we propose a privacy-preserving inference algorithm with low multiplicative depth, namely broad learning inference based on fully homomorphic encryption. We also extend the algorithm to the BLS model with incremental learning. We implement the privacy-preserving BLS for the first time using TENSEAL’s CKKS scheme, and also verify the effectiveness of BLS inference with incremental learning. Experimental evaluations demonstrate the inference accuracy of 0.928 and 0.672 for datasets of MNIST and NORB, respectively.

Cite

CITATION STYLE

APA

Deng, X., Sang, Y., & Li, Z. (2023). Broad Learning Inference Based on Fully Homomorphic Encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13798 LNCS, pp. 497–508). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-29927-8_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free