Learning in the Dark: Privacy-Preserving Machine Learning using Function Approximation

被引:0
作者
Khan, Tanveer [1 ]
Michalas, Antonis [1 ,2 ]
机构
[1] Tampere Univ, Dept Comp Sci, Tampere, Finland
[2] RISE Res Inst Sweden, Boras, Sweden
来源
2023 IEEE 22ND INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS, TRUSTCOM, BIGDATASE, CSE, EUC, ISCI 2023 | 2024年
关键词
Activation Function; Homomorphic Encryption; Neural Networks; Polynomial Approximation; Privacy;
D O I
10.1109/TrustCom60117.2023.00031
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Over the past few years, a tremendous growth of machine learning was brought about by a significant increase in adoption and implementation of cloud-based services. As a result, various solutions have been proposed in which the machine learning models run on a remote cloud provider and not locally on a user's machine. However, when such a model is deployed on an untrusted cloud provider, it is of vital importance that the users' privacy is preserved. To this end, we propose Learning in the Dark - a hybrid machine learning model in which the training phase occurs in plaintext data, but the classification of the users' inputs is performed directly on homomorphically encrypted ciphertexts. To make our construction compatible with homomorphic encryption, we approximate the ReLU and Sigmoid activation functions using low-degree Chebyshev polynomials. This allowed us to build Learning in the Dark - a privacy-preserving machine learning model that can classify encrypted images with high accuracy. Learning in the Dark preserves users' privacy since it is capable of performing high accuracy predictions by performing computations directly on encrypted data. In addition to that, the output of Learning in the Dark is generated in a blind and therefore privacy-preserving way by utilizing the properties of homomorphic encryption.
引用
收藏
页码:62 / 71
页数:10
相关论文
共 44 条
[1]   A Survey on Homomorphic Encryption Schemes: Theory and Implementation [J].
Acar, Abbas ;
Aksu, Hidayet ;
Uluagac, A. Selcuk ;
Conti, Mauro .
ACM COMPUTING SURVEYS, 2018, 51 (04)
[2]  
Albawi S, 2017, I C ENG TECHNOL
[3]  
[Anonymous], 2019, Microsoft SEAL (Release 3.6)
[4]  
Atkinson Kendall, 2005, Theoretical numerical analysis, V39
[5]   Fast Homomorphic Evaluation of Deep Discretized Neural Networks [J].
Bourse, Florian ;
Minelli, Michele ;
Minihold, Matthias ;
Paillier, Pascal .
ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III, 2018, 10993 :483-512
[6]  
Brakerski Zvika, 2014, ACM Transactions on Computation Theory, V6, DOI 10.1145/2633600
[7]  
Bunn P, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P486
[8]  
Chabanne H., 2017, IACR Cryptol. ePrint Arch., P1, DOI DOI 10.1109/WITS.2017.7934613
[9]  
Chou ED, 2018, Arxiv, DOI [arXiv:1811.09953, DOI 10.48550/ARXIV.1811.09953]
[10]  
Crawford J. L., 2018, P 6 WORKSH ENCR COMP