Pith. sign in

REVIEW 2 cited by

DP-BREM: Differentially-Private and Byzantine-Robust Federated Learning with Client Momentum

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 2306.12608 v4 pith:5QMYTBCI submitted 2023-06-22 cs.CR

classification cs.CR
keywords robustnessclientsdp-bremprivacylearningmomentumbyzantineclient
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Federated Learning (FL) allows multiple participating clients to train machine learning models collaboratively while keeping their datasets local and only exchanging the gradient or model updates with a coordinating server. Existing FL protocols are vulnerable to attacks that aim to compromise data privacy and/or model robustness. Recently proposed defenses focused on ensuring either privacy or robustness, but not both. In this paper, we focus on simultaneously achieving differential privacy (DP) and Byzantine robustness for cross-silo FL, based on the idea of learning from history. The robustness is achieved via client momentum, which averages the updates of each client over time, thus reducing the variance of the honest clients and exposing the small malicious perturbations of Byzantine clients that are undetectable in a single round but accumulate over time. In our initial solution DP-BREM, DP is achieved by adding noise to the aggregated momentum, and we account for the privacy cost from the momentum, which is different from the conventional DP-SGD that accounts for the privacy cost from the gradient. Since DP-BREM assumes a trusted server (who can obtain clients' local models or updates), we further develop the final solution called DP-BREM+, which achieves the same DP and robustness properties as DP-BREM without a trusted server by utilizing secure aggregation techniques, where DP noise is securely and jointly generated by the clients. Both theoretical analysis and experimental results demonstrate that our proposed protocols achieve better privacy-utility tradeoff and stronger Byzantine robustness than several baseline methods, under different DP budgets and attack settings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Towards Trustworthy Federated Learning with Untrusted Participants

    cs.LG 2025-05 conditional novelty 7.0 of 10

    CAFCOR combines pairwise shared-randomness correlated noise with a covariance-agnostic robust filter to achieve central-DP-like utility under the SecLDP trust model with Byzantine workers and an untrusted server.

  2. Perfect Privacy for Discriminator-Based Byzantine-Resilient Federated Learning

    cs.LG 2025-06 reject novelty 4.0 of 10

    ByITFL and LoByITFL are Byzantine-resilient federated learning schemes that claim perfect information-theoretic privacy using a polynomial discriminator and secret sharing, but the privacy proof has a gap around per-u...

Pith tools