Towards Practical Secure Privacy-Preserving Machine (Deep) Learning with Distributed Data

被引:2
作者
Kumar, Mohit [1 ,2 ]
Moser, Bernhard [1 ]
Fischer, Lukas [1 ]
Freudenthaler, Bernhard [1 ]
机构
[1] Software Competence Ctr Hagenberg GmbH, A-4232 Hagenberg, Austria
[2] Univ Rostock, Fac Comp Sci & Elect Engn, Inst Automat, Rostock, Germany
来源
DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2022 WORKSHOPS | 2022年 / 1633卷
基金
欧盟地平线“2020”;
关键词
Privacy; Homomorphic encryption; Machine learning; Differential privacy; Membership-mappings; FULLY HOMOMORPHIC ENCRYPTION; MEMBERSHIP-MAPPINGS;
D O I
10.1007/978-3-031-14343-4_6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A methodology for practical secure privacy-preserving distributed machine (deep) learning is proposed via addressing the core issues of fully homomorphic encryption, differential privacy, and scalable fast machine learning. Considering that private data is distributed and the training data may contain directly or indirectly an information about private data, an architecture and a methodology are suggested for 1. mitigating the impracticality issue of fully homomorphic encryption (arising from large computational overhead) via very fast gate-by-gate bootstrapping and introducing a learning scheme that requires homomorphic computation of only efficient-to-evaluate functions; 2. addressing the privacy-accuracy tradeoff issue of differential privacy via optimizing the noise adding mechanism; 3. defining an information theoretic measure of privacy-leakage for the design and analysis of privacy-preserving schemes; and 4. addressing the optimal model size determination issue and computationally fast training issue of scalable and fast machine (deep) learning with an alternative approach based on variational learning. A biomedical application example is provided to demonstrate the application potential of the proposed methodology.
引用
收藏
页码:55 / 66
页数:12
相关论文
共 47 条
[1]   Deep Learning with Differential Privacy [J].
Abadi, Martin ;
Chu, Andy ;
Goodfellow, Ian ;
McMahan, H. Brendan ;
Mironov, Ilya ;
Talwar, Kunal ;
Zhang, Li .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :308-318
[2]  
[Anonymous], ADV NEURAL INFORM PR
[3]  
Balle B, 2018, PR MACH LEARN RES, V80
[4]  
Basciftci YO, 2016, 2016 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA)
[5]  
Brakerski Z., 2012, P ITCS, P309, DOI [10.1145/2090236.2090262, DOI 10.1145/2090236.2090262]
[6]   Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP [J].
Brakerski, Zvika .
ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 :868-886
[7]  
Calmon FD, 2012, ANN ALLERTON CONF, P1401, DOI 10.1109/Allerton.2012.6483382
[8]  
Cheon JH, 2013, LECT NOTES COMPUT SC, V7881, P315, DOI 10.1007/978-3-642-38348-9_20
[9]   Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE [J].
Chillotti, Ilaria ;
Gama, Nicolas ;
Georgieva, Mariya ;
Izabachene, Malika .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT I, 2017, 10624 :377-408
[10]   Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds [J].
Chillotti, Ilaria ;
Gama, Nicolas ;
Georgieva, Mariya ;
Izabachene, Malika .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2016, PT I, 2016, 10031 :3-33