CARVY-FL: Client Anticlustering for Robust Voting in Provably Secure Federated Learning
A new federated learning defence uses client anticlustering to improve voting-based aggregation robustness against Byzantine poisoning while preserving provable security properties.
Summary written by editorial AI · Source link below
arXiv:2608.28992v1 Announce Type: new Abstract: Federated learning (FL) enables collaborative training without directly sharing raw data, but remains vulnerable to malicious clients. Voting-based FL improves robustness by partitioning clients into groups, training one model per group, and aggregating predictions by plurality voting. However, under class-disjoint non-IID data, distribution-oblivious grouping can yield highly variable certified accuracy (CA). We propose CARVY-FL, which estimates
Editorial Analysis
Enterprises running federated learning across untrusted participants need stronger defences against model poisoning; anticlustering-based voting could raise the bar.
Forward-looking interpretation drafted by editorial AI under human review — not a reproduction of the source. See methodology.
External link — opens at arXiv Crypto & Security in a new tab.
More from the Research Desk
- 39 New Methods That Compromise Passkey Authentication3d
- Security Vulnerability in a Voting System3d
- Selfie-Capture Dynamics as an Auxiliary Signal Against Deepfakes and Injection Attacks for Mobile Identity Verification4d
- How Reliable Is the Multi-Input Heuristic for Bitcoin Address Clustering in Law Enforcement Contexts?4d
- Privacy Leakage in Federated Learning: Gradient-Based Client Identity Inference and Defenses for Inertial Sensing in Vehicular Edge Networks4d