FLAME: Differentially Private Federated Learning in the Shuffle Model
Ruixuan Liu, Yang Cao, Hong Chen, Ruoyang Guo, Masatoshi Yoshikawa

TL;DR
This paper introduces a new federated learning framework in the shuffle model that achieves high accuracy and strong privacy without a trusted analyzer by leveraging privacy amplification and subsampling techniques.
Contribution
It proposes three protocols (SS-Simple, SS-Double, SS-Topk) that enhance privacy amplification and utility in federated learning within the shuffle model, addressing limitations of existing models.
Findings
SS-Topk improves testing accuracy by 60.7% over local model FL
Enhanced protocols increase privacy amplification effect
Theoretical analysis supports improved privacy and utility
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 \textit{curator model} or \textit{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 \textit{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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsPrivacy-Preserving Technologies in Data
MethodsGradient Sparsification
