Privacy-Preserving Robust Federated Learning with Distributed Differential Privacy

被引:3
作者
Wang, Fayao [1 ]
He, Yuanyuan [1 ]
Guo, Yunchuan [2 ]
Li, Peizhi [1 ]
Wei, Xinyu [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Cyber Sci & Engn, Wuhan, Peoples R China
[2] Chinese Acad Sci, Inst Informat Engn, Beijing, Peoples R China
来源
2022 IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS, TRUSTCOM | 2022年
基金
中国国家自然科学基金;
关键词
Federated learning; privacy-preserving; robust aggregation;
D O I
10.1109/TrustCom56396.2022.00087
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Federated Learning (FL) has attracted significant interest, as it provides a distributed machine learning paradigm to share data resources during model training process. However, sharing the gradients or model weights uploaded by clients or the final model aggregated by the server can lead to privacy disclosures and executing correctness issues. Specifically, the original data can be easily inferred through analyzing the shared gradients, and malicious users can disrupt the model aggregation to result in a destruction of the model accuracy. To address these issues, we propose a novel FL scheme with providing both privacy protection and robust aggregation. By using the distributed differential privacy and range proof technologies, the proposed scheme resists semi-honest servers and malicious users, while protecting the global model and providing the high accuracy. Both privacy analysis and experiments are given to demonstrate the effectiveness of our scheme.
引用
收藏
页码:598 / 605
页数:8
相关论文
共 32 条
[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], 2009, CIFAR-100 Dataset
[3]  
Bhowmick A, 2019, Arxiv, DOI arXiv:1812.00984
[4]   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
[5]  
McMahan HB, 2018, Arxiv, DOI arXiv:1710.06963
[6]  
Bu Zhiqi, 2020, Harv Data Sci Rev, V2020, DOI 10.1162/99608f92.cfc5dd25
[7]   Bulletproofs: Short Proofs for Confidential Transactions and More [J].
Bunz, Benedikt ;
Bootle, Jonathan ;
Boneh, Dan ;
Poelstra, Andrew ;
Wuille, Pieter ;
Maxwell, Greg .
2018 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2018, :315-334
[8]  
Camenisch J., 1997, Proof systems for general statements about discrete logarithms, V260
[9]  
Cohen H., 1993, COURSE COMPUTATIONAL, V138, DOI 10.1007/978-3-662-02945-9
[10]  
Dong JS, 2019, Arxiv, DOI arXiv:1905.02383