On Lightweight Privacy-preserving Collaborative Learning for Internet of Things by Independent Random Projections

被引:10
作者
Jiang, Linshan [1 ]
Tan, Rui [1 ]
Lou, Xin [2 ]
Lin, Guosheng [1 ]
机构
[1] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore, Singapore
[2] Illinois Singapore Pte Ltd, Adv Digital Sci Ctr, Singapore, Singapore
来源
ACM TRANSACTIONS ON INTERNET OF THINGS | 2021年 / 2卷 / 02期
基金
新加坡国家研究基金会;
关键词
Internet of Things; collaborative learning; privacy;
D O I
10.1145/3441303
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Internet of Things (IoT) will be a main data generation infrastructure for achieving better system intelligence. This article considers the design and implementation of a practical privacy-preserving collaborative learning scheme, in which a curious learning coordinator trains a better machine learning model based on the data samples contributed by a number of IoT objects, while the confidentiality of the raw forms of the training data is protected against the coordinator. Existing distributed machine learning and data encryption approaches incur significant computation and communication overhead, rendering them ill-suited for resource-constrained IoT objects. We study an approach that applies independent random projection at each IoT object to obfuscate data and trains a deep neural network at the coordinator based on the projected data from the IoT objects. This approach introduces light computation overhead to the IoT objects and moves most workload to the coordinator that can have sufficient computing resources. Although the independent projections performed by the IoT objects address the potential collusion between the curious coordinator and some compromised IoT objects, they significantly increase the complexity of the projected data. In this article, we leverage the superior learning capability of deep learning in capturing sophisticated patterns to maintain good learning performance. Extensive comparative evaluation shows that this approach outperforms other lightweight approaches that apply additive noisification for differential privacy and/or support vector machines for learning in the applications with light to moderate data pattern complexities.
引用
收藏
页数:32
相关论文
共 64 条
[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]   THE FAST JOHNSON-LINDENSTRAUSS TRANSFORM AND APPROXIMATE NEAREST NEIGHBORS [J].
Ailon, Nir ;
Chazelle, Bernard .
SIAM JOURNAL ON COMPUTING, 2009, 39 (01) :302-322
[3]  
[Anonymous], 2008, Technical Report MSR-TR-2008-35
[4]  
Aslett LJM, 2015, Arxiv, DOI [arXiv:1508.06574, 10.48550/arXiv.1508.06574, DOI 10.48550/ARXIV.1508.06574]
[5]  
Bebensee B., 2019, arXiv
[6]  
Ben-Israel A., 2003, Generalized inverses: theory and applications, V15
[7]   Combining geometry and combinatorics: a unified approach to sparse signal recovery [J].
Berinde, R. ;
Gilbert, A. C. ;
Indyk, P. ;
Karloff, H. ;
Strauss, M. J. .
2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, :798-+
[8]  
Berr Jonathan, 2018, EQUIFAX BREACH EXPOS
[9]   ON ITERATIVE ALGORITHMS FOR LINEAR LEAST-SQUARES PROBLEMS WITH BOUND CONSTRAINTS [J].
BIERLAIRE, M ;
TOINT, PL ;
TUYTTENS, D .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1991, 143 :111-143
[10]   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