Quand les gradients révèlent des informations : portée et limites des attaques par reconstruction en apprentissage fédéré

Federated Learning (FL) enables collaborative model training without centralizing data, reducing privacy risks by sharing only model updates. Yet these updates can themselves reveal sensitive information, making FL vulnerable to reconstruction attacks that recover inputs or labels. This thesis investigates such vulnerabilities under realistic protocols considering both classification and regression tasks. It reveals that privacy risks are broader and more severe than previously assumed. Through extensive experimentation, we demonstrate that the widely adopted FedAvg protocol is far from immune. Privacy leakage is not restricted to early rounds or simple models, but instead may peak when models learn most effectively, where updates carry rich information exploitable by adversaries. This challenges the common belief that leakage decreases monotonically as training proceeds, emphasizing the need to assess privacy across the full training trajectory. We further show that the structure of client optimization can be harnessed to improve attacks: parameter trajectories in FedAvg follow geometric regularities that adversaries can exploit to stabilize and enhance reconstructions. Beyond inputs, we establish that regression labels, often sensitive continuous values such as salaries or medical measurements, are also at risk. By connecting regression leakage to the Hidden Subset Sum Problem from cryptography, we show that labels can be reconstructed efficiently, accurately, and in some cases with verifiable guarantees. Overall, this thesis presents a unified and empirically grounded examination of privacy leakage in FL. It reveals that reconstruction risk is a structural property of learning dynamics, not an artifact of simplified settings, and that it extends to both classification and regression tasks. These results will help optimize existing defenses to account for training phases, optimization geometry, and task-specific vulnerabilities, if FL is to fulfill its promise of protecting data privacy in practice.

Authors

Publication Details

Published
2025-11-27
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quand les gradients révèlent des informations : portée et limites des attaques par reconstruction en apprentissage fédéré

Pierre Jobic
Privacy-Preserving Technologies in Data
article

Quand les gradients révèlent des informations : portée et limites des attaques par reconstruction en apprentissage fédéré

Pierre Jobic
article en

Abstract

Federated Learning (FL) enables collaborative model training without centralizing data, reducing privacy risks by sharing only model updates. Yet these updates can themselves reveal sensitive information, making FL vulnerable to reconstruction attacks that recover inputs or labels. This thesis investigates such vulnerabilities under realistic protocols considering both classification and regression tasks. It reveals that privacy risks are broader and more severe than previously assumed. Through extensive experimentation, we demonstrate that the widely adopted FedAvg protocol is far from immune. Privacy leakage is not restricted to early rounds or simple models, but instead may peak when models learn most effectively, where updates carry rich information exploitable by adversaries. This challenges the common belief that leakage decreases monotonically as training proceeds, emphasizing the need to assess privacy across the full training trajectory. We further show that the structure of client optimization can be harnessed to improve attacks: parameter trajectories in FedAvg follow geometric regularities that adversaries can exploit to stabilize and enhance reconstructions. Beyond inputs, we establish that regression labels, often sensitive continuous values such as salaries or medical measurements, are also at risk. By connecting regression leakage to the Hidden Subset Sum Problem from cryptography, we show that labels can be reconstructed efficiently, accurately, and in some cases with verifiable guarantees. Overall, this thesis presents a unified and empirically grounded examination of privacy leakage in FL. It reveals that reconstruction risk is a structural property of learning dynamics, not an artifact of simplified settings, and that it extends to both classification and regression tasks. These results will help optimize existing defenses to account for training phases, optimization geometry, and task-specific vulnerabilities, if FL is to fulfill its promise of protecting data privacy in practice.

Openalex Percentile: Top 16%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.