Logistic regression model training based on the approximate homomorphic encryption

被引:132
作者
Kim, Andrey [1 ]
Song, Yongsoo [2 ]
Kim, Miran [3 ]
Lee, Keewoo [1 ]
Cheon, Jung Hee [1 ]
机构
[1] Seoul Natl Univ, Dept Math Sci, 1 Gwanak Ro, Seoul 08826, South Korea
[2] Univ Calif San Diego, Dept Comp Sci & Engn, 9500 Gillman Dr, San Diego, CA 92093 USA
[3] Univ Calif San Diego, Div Biomed Informat, 9500 Gillman Dr, San Diego, CA 92093 USA
基金
新加坡国家研究基金会;
关键词
Homomorphic encryption; Machine learning; Logistic regression;
D O I
10.1186/s12920-018-0401-7
中图分类号
Q3 [遗传学];
学科分类号
071007 ; 090102 ;
摘要
Background: Security concerns have been raised since big data became a prominent tool in data analysis. For instance, many machine learning algorithms aim to generate prediction models using training data which contain sensitive information about individuals. Cryptography community is considering secure computation as a solution for privacy protection. In particular, practical requirements have triggered research on the efficiency of cryptographic primitives. Methods: This paper presents a method to train a logistic regression model without information leakage. We apply the homomorphic encryption scheme of Cheon et al. (ASIACRYPT 2017) for an efficient arithmetic over real numbers, and devise a new encoding method to reduce storage of encrypted database. In addition, we adapt Nesterov's accelerated gradient method to reduce the number of iterations as well as the computational cost while maintaining the quality of an output classifier. Results: Our method shows a state-of-the-art performance of homomorphic encryption system in a real-world application. The submission based on this work was selected as the best solution of Track 3 at iDASH privacy and security competition 2017. For example, it took about six minutes to obtain a logistic regression model given the dataset consisting of 1579 samples, each of which has 18 features with a binary outcome variable. Conclusions: We present a practical solution for outsourcing analysis tools such as logistic regression analysis while preserving the data confidentiality.
引用
收藏
页数:9
相关论文
共 26 条
[1]   On the concrete hardness of Learning with Errors [J].
Albrecht, Martin R. ;
Player, Rachel ;
Scott, Sam .
JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2015, 9 (03) :169-203
[2]  
[Anonymous], 2016, IMPLEMENTATION HEAAN
[3]  
[Anonymous], IEEE S SEC PRIV
[4]  
[Anonymous], 2001, ORDINAL LOGISTIC REG
[5]  
[Anonymous], BIOMEDICAL RES CHANG
[6]  
[Anonymous], 1983, SOV MATH DOKL
[7]   Scalable and Secure Logistic Regression via Homomorphic Encryption [J].
Aono, Yoshinori ;
Hayashi, Takuya ;
Le Trieu Phong ;
Wang, Lihua .
CODASPY'16: PROCEEDINGS OF THE SIXTH ACM CONFERENCE ON DATA AND APPLICATION SECURITY AND PRIVACY, 2016, :142-144
[8]  
Cheon JH, 2017, IMPLEMENTATION IDASH
[9]   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
[10]   Bootstrapping for Approximate Homomorphic Encryption [J].
Cheon, Jung Hee ;
Han, Kyoohyung ;
Kim, Andrey ;
Kim, Miran ;
Song, Yongsoo .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT I, 2018, 10820 :360-384