Pith. sign in

REVIEW 3 cited by

Local and Central Differential Privacy for Robustness and Privacy in Federated Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.03561 v5 pith:FUQXXKVL submitted 2020-09-08 cs.CR cs.AI

classification cs.CRcs.AI
keywords privacyrobustnessattacksdifferentiallearninglocalbackdoorcentral
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated Learning (FL) allows multiple participants to train machine learning models collaboratively by keeping their datasets local while only exchanging model updates. Alas, this is not necessarily free from privacy and robustness vulnerabilities, e.g., via membership, property, and backdoor attacks. This paper investigates whether and to what extent one can use differential Privacy (DP) to protect both privacy and robustness in FL. To this end, we present a first-of-its-kind evaluation of Local and Central Differential Privacy (LDP/CDP) techniques in FL, assessing their feasibility and effectiveness. Our experiments show that both DP variants do d fend against backdoor attacks, albeit with varying levels of protection-utility trade-offs, but anyway more effectively than other robustness defenses. DP also mitigates white-box membership inference attacks in FL, and our work is the first to show it empirically. Neither LDP nor CDP, however, defend against property inference. Overall, our work provides a comprehensive, re-usable measurement methodology to quantify the trade-offs between robustness/privacy and utility in differentially private FL.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix

    cs.CR 2025-07 conditional novelty 6.0 of 10

    A matrix-based private subgraph counting framework, NAM, yields new triangle, quadrangle, and 2-star counting algorithms under edge-LDP.

  2. FedGraM: Defending Against Untargeted Attacks in Federated Learning via Embedding Gram Matrix

    cs.LG 2025-05 conditional novelty 5.0 of 10

    A server that keeps one example per class can detect and drop malicious federated-learning clients by measuring how separated their learned embeddings are, via the norm of a Gram matrix.

  3. A Survey: Towards Privacy and Security in Mobile Large Language Models

    cs.CR 2025-09 conditional

    A survey of privacy and security challenges for mobile large language models, summarizing known attack types and defenses without introducing new results.

Pith tools