FLAME: Differentially Private Federated Learning in the Shuffle Model
Ruixuan Liu, Yang Cao, Hong Chen, Ruoyang Guo, Masatoshi Yoshikawa
Abstract
Federated Learning (FL) is a promising machine learning paradigm that enables the analyzer to train a model without collecting users' raw data. To ensure users' privacy, differentially private federated learning has been intensively studied. The existing works are mainly based on the curator model or local model of differential privacy. However, both of them have pros and cons. The curator model allows greater accuracy but requires a trusted analyzer. In the local model where users randomize local data before sending them to the analyzer, a trusted analyzer is not required but the accuracy is limited. In this work, by leveraging the privacy amplification effect in the recently proposed shuffle model of differential privacy, we achieve the best of two worlds, i.e., accuracy in the curator model and strong privacy without relying on any trusted party. We first propose an FL framework in the shuffle model and a simple protocol (SS-Simple) extended from existing work. We find that SS-Simple only provides an insufficient privacy amplification effect in FL since the dimension of the model parameter is quite large. To solve this challenge, we propose an enhanced protocol (SS-Double) to increase the privacy amplification effect by subsampling. Furthermore, for boosting the utility when the model size is greater than the user population, we propose an advanced protocol (SS-Topk) with gradient sparsification techniques. We also provide theoretical analysis and numerical evaluations of the privacy amplification of the proposed protocols. Experiments on real-world dataset validate that SS-Topk improves the testing accuracy by 60.7% than the local model based FL. We highlight an observation that SS-Topk improves the accuracy by 33.94% than the curator model based FL without any trusted party. Compared with non-private FL, our protocol SS-Topk only lose 1.48% accuracy under (2.348, 5e-6)-DP per epoch.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 8d0a8cf7-c661-4477-95a6-3684391f2c3bCited by top-tier papers16
- DENSE: Data-Free One-Shot Federated LearningJie Zhang, Chen Chen, Bo Li, Lingjuan Lyu et al.NeurIPS 2022 · 202 citations
- Secure Shapley Value for Cross-Silo Federated LearningShuyuan Zheng, Yang Cao, Masatoshi YoshikawaVLDB 2023 · 41 citations
- Differentially Private Triangle and 4-Cycle Counting in the Shuffle ModelJacob Imola, Takao Murakami, Kamalika ChaudhuriCCS 2022 · 30 citations
- A Generalized Shuffle Framework for Privacy Amplification: Strengthening Privacy Guarantees and Enhancing UtilityE. Chen, Yang Cao, Yifei GeAAAI 2024 · 16 citations
- Privacy as a Resource in Differentially Private Federated LearningJinliang Yuan, Shangguang Wang, Shihe Wang, Yuanchun Li et al.INFOCOM 2023 · 15 citations
Builds on4
- Deep Learning with Differential PrivacyMartín Abadi, Andy Chu, Ian J. Goodfellow, H. Brendan McMahan et al.CCS 2016 · 7,620 citations
- Membership Inference Attacks Against Machine Learning ModelsReza Shokri, Marco Stronati, Congzheng Song, Vitaly ShmatikovS&P 2017 · 5,137 citations
- Comprehensive Privacy Analysis of Deep Learning: Passive and Active White-box Inference Attacks against Centralized and Federated LearningMilad Nasr, Reza Shokri, Amir HoumansadrS&P 2019 · 1,778 citations
- Deep Models Under the GAN: Information Leakage from Collaborative Deep LearningBriland Hitaj, Giuseppe Ateniese, Fernando Pérez-CruzCCS 2017 · 1,581 citations
Related papers
- Echo of Neighbors: Privacy Amplification for Personalized Private Federated Learning with Shuffle ModelYixuan Liu, Suyun Zhao, Li Xiong, Yuhan Liu et al.AAAI 2023 · 18 citations
- Renyi Differential Privacy of The Subsampled Shuffle Model In Distributed LearningAntonious M. Girgis, Deepesh Data, Suhas N. DiggaviNeurIPS 2021 · 28 citations
- Privacy Amplification via Random Check-InsBorja Balle, Peter Kairouz, Brendan McMahan, Om Dipakbhai Thakkar et al.NeurIPS 2020 · 86 citations
- Camel: Communication-Efficient and Maliciously Secure Federated Learning in the Shuffle Model of Differential PrivacyShuangqing Xu, Yifeng Zheng, Zhongyun HuaCCS 2024 · 5 citations
- Network Shuffling: Privacy Amplification via Random WalksSeng Pei Liew, Tsubasa Takahashi, Shun Takagi, Fumiyuki Kato et al.SIGMOD 2022 · 12 citations
