Logistic Regression on Homomorphic Encrypted Data at Scale

被引:0
作者
Han, Kyoohyung [1 ]
Hong, Seungwan [1 ]
Cheon, Jung Hee [1 ]
Park, Daejun [2 ]
机构
[1] Seoul Natl Univ, Seoul, South Korea
[2] Univ Illinois, Urbana, IL 61801 USA
来源
THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2019年
基金
新加坡国家研究基金会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Machine learning on (homomorphic) encrypted data is a cryptographic method for analyzing private and/or sensitive data while keeping privacy. In the training phase, it takes as input an encrypted training data and outputs an encrypted model without ever decrypting. In the prediction phase, it uses the encrypted model to predict results on new encrypted data. In each phase, no decryption key is needed, and thus the data privacy is ultimately guaranteed. It has many applications in various areas such as finance, education, genomics, and medical field that have sensitive private data. While several studies have been reported on the prediction phase, few studies have been conducted on the training phase. In this paper, we present an efficient algorithm for logistic regression on homomorphic encrypted data, and evaluate our algorithm on real financial data consisting of 422,108 samples over 200 features. Our experiment shows that an encrypted model with a sufficient Kolmogorov Smirnow statistic value can be obtained in similar to 17 hours in a single machine. We also evaluate our algorithm on the public MNIST dataset, and it takes similar to 2 hours to learn an encrypted model with 96.4% accuracy. Considering the inefficiency of homomorphic encryption, our result is encouraging and demonstrates the practical feasibility of the logistic regression training on large encrypted data, for the first time to the best of our knowledge.
引用
收藏
页码:9466 / 9471
页数:6
相关论文
共 19 条
[1]  
[Anonymous], 2016111 CRYPT EPRINT
[2]  
[Anonymous], 2018, 2018254 CRYPT EPRINT
[3]  
[Anonymous], IEEE S SEC PRIV
[4]  
[Anonymous], 2017, 20171114 CRYPT EPRIN
[5]  
[Anonymous], 27 USENIX SEC S USEN
[6]  
[Anonymous], 2018662 CRYPT EPRINT
[7]  
[Anonymous], HELR
[8]  
Brakerski Zvika, 2014, ACM Transactions on Computation Theory, V6, DOI 10.1145/2633600
[9]   Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP [J].
Brakerski, Zvika .
ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 :868-886
[10]   Homomorphic Encryption for Arithmetic of Approximate Numbers [J].
Cheon, Jung Hee ;
Kim, Andrey ;
Kim, Miran ;
Song, Yongsoo .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT I, 2017, 10624 :409-437