Privacy-Preserving Machine Learning Training in IoT Aggregation Scenarios

被引:10
作者
Zhu, Liehuang [1 ]
Tang, Xiangyun [1 ]
Shen, Meng [1 ]
Gao, Feng [2 ]
Zhang, Jie [1 ]
Du, Xiaojiang [3 ]
机构
[1] Beijing Inst Technol, Sch Cyberspace Secur, Beijing 100811, Peoples R China
[2] Zhejiang Lab, Zhejiang Lab Res Ctr Cyber Phys Social Syst, Hangzhou 311121, Peoples R China
[3] Temple Univ, Dept Comp & Informat Sci, Philadelphia, PA 19122 USA
基金
北京市自然科学基金;
关键词
Training; Data models; Computational modeling; Encryption; Protocols; Servers; Collaboration; Homomorphic encryption; Internet-of-Things (IoT) data; machine learning (ML); modular sequential composition; secure two-party computation; SUPPORT VECTOR MACHINE; CLASSIFICATION; SECURITY;
D O I
10.1109/JIOT.2021.3060764
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In developing smart city, the growing popularity of machine learning (ML) that appreciates high-quality training data sets generated from diverse Internet-of-Things (IoT) devices raises natural questions about the privacy guarantees that can be provided in such settings. Privacy-preserving ML training in an aggregation scenario enables a model demander to securely train ML models with the sensitive IoT data gathered from IoT devices. The existing solutions are generally server aided, cannot deal with the collusion threat between the servers or between the servers and data owners, and do not match the delicate environments of IoT. We propose a privacy-preserving ML training framework named Heda that consists of a library of building blocks based on partial homomorphic encryption, which enables constructing multiple privacy-preserving ML training protocols for the aggregation scenario without the assistance of untrusted servers, and defending the security under collusion situations. Rigorous security analysis demonstrates the proposed protocols can protect the privacy of each participant in the honest-but-curious model and guarantee the security under most collusion situations. Extensive experiments validate the efficiency of Heda, which achieves privacy-preserving ML training without losing the model accuracy.
引用
收藏
页码:12106 / 12118
页数:13
相关论文
共 56 条
[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]  
Acs Gergely, 2011, Information Hiding. 13th International Conference, IH 2011. Revised Selected Papers, P118, DOI 10.1007/978-3-642-24178-9_9
[3]   Internet of Things: A survey on the security of IoT frameworks [J].
Ammar, Mahmoud ;
Russello, Giovanni ;
Crispo, Bruno .
JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2018, 38 :8-27
[4]   Input and Output Privacy-Preserving Linear Regression [J].
Aono, Yoshinori ;
Hayashi, Takuya ;
Phong, Le Trieu ;
Wang, Lihua .
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (10) :2339-2347
[5]   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
[6]   Privacy-Preserving Logistic Regression with Distributed Data Sources via Homomorphic Encryption [J].
Aono, Yoshinori ;
Hayashi, Takuya ;
Phong, Le Trieu ;
Wang, Lihua .
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016, E99D (08) :2079-2089
[7]   Practical Secure Aggregation for Privacy-Preserving Machine Learning [J].
Bonawitz, Keith ;
Ivanov, Vladimir ;
Kreuter, Ben ;
Marcedone, Antonio ;
McMahan, H. Brendan ;
Patel, Sarvar ;
Ramage, Daniel ;
Segal, Aaron ;
Seth, Karn .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :1175-1191
[8]  
Boneh Dan, 1999, Notices of the AMS, V46, P203
[9]  
Bost R., 2014, P NETW DISTR SYST SE P NETW DISTR SYST SE, P1
[10]   Security and composition of multiparty cryptographic protocols [J].
Canetti, R .
JOURNAL OF CRYPTOLOGY, 2000, 13 (01) :143-202