An Accurate, Scalable and Verifiable Protocol for Federated Differentially Private Averaging
C\'esar Sabater, Aur\'elien Bellet, Jan Ramon

TL;DR
This paper introduces a scalable federated averaging protocol that ensures differential privacy and correctness verification, even with malicious parties, by combining correlated Gaussian noise and cryptographic proofs.
Contribution
It presents a novel, scalable protocol for federated averaging with differential privacy guarantees and verifiable correctness, suitable for networks with malicious participants.
Findings
Nearly matches trusted curator utility with logarithmic communication per party.
Maintains privacy and correctness in the presence of malicious parties.
Uses cryptographic primitives for efficient verification.
Abstract
Learning from data owned by several parties, as in federated learning, raises challenges regarding the privacy guarantees provided to participants and the correctness of the computation in the presence of malicious parties. We tackle these challenges in the context of distributed averaging, an essential building block of federated learning algorithms. Our first contribution is a scalable protocol in which participants exchange correlated Gaussian noise along the edges of a network graph, complemented by independent noise added by each party. We analyze the differential privacy guarantees of our protocol and the impact of the graph topology under colluding malicious parties, showing that we can nearly match the utility of the trusted curator model even when each honest party communicates with only a logarithmic number of other parties chosen at random. This is in contrast with protocols…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Complexity and Algorithms in Graphs
