A Quantitative Metric for Privacy Leakage in Federated Learning
Yong Liu, Xinghua Zhu, Jianzong Wang, Jing Xiao

TL;DR
This paper introduces a mutual information-based metric to quantify privacy leakage risk in federated learning, addressing high-dimensional gradient data and revealing factors influencing leakage risk.
Contribution
It proposes a novel method to estimate mutual information between high-dimensional gradients and data, enabling quantitative privacy risk assessment in federated learning.
Findings
The metric reliably reflects information leakage extent.
Leakage risk depends on model status and data distribution.
The method handles high-dimensional gradient data effectively.
Abstract
In the federated learning system, parameter gradients are shared among participants and the central modulator, while the original data never leave their protected source domain. However, the gradient itself might carry enough information for precise inference of the original data. By reporting their parameter gradients to the central server, client datasets are exposed to inference attacks from adversaries. In this paper, we propose a quantitative metric based on mutual information for clients to evaluate the potential risk of information leakage in their gradients. Mutual information has received increasing attention in the machine learning and data mining community over the past few years. However, existing mutual information estimation methods cannot handle high-dimensional variables. In this paper, we propose a novel method to approximate the mutual information between the…
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 · Adversarial Robustness in Machine Learning · Stochastic Gradient Optimization Techniques
