InfoResearchPeer-reviewed
Efficient Byzantine-Robust Privacy-Preserving Federated Learning via Dimension Compression
- Published
- Record updated
Summary
Researchers propose a federated learning scheme that combines homomorphic encryption with Johnson-Lindenstrauss dimension compression and a dual-server architecture, defending against Byzantine clients making up to 40% of the network. Compression cuts cryptographic operations from O(dn) to O(kn), where k is much smaller than d, reducing computational overhead 25 to 35 times and communication overhead 17 times relative to the non-compression version, while keeping accuracy comparable to non-private FL.
Related items
- MediumCVE-2026-121936: easyVoice server-side request forgery through openaiBaseUrl in /api/v1/ttsSimilar attack · NVD/CVE Database
- MediumCVE-2026-118628: MLflow get-artifacts server-side request forgery information disclosureSimilar attack · NVD/CVE Database
- HighCVE-2026-118625: MLflow Tracking Server privilege escalation via get_endpointsSimilar attack · NVD/CVE Database
- InfoWhen trust becomes the payload: Inside the threats, etc quarterly reportSimilar attack · Elastic Security Labs
- MediumCritical Langflow flaws enable authentication bypass and RCESimilar attack · CSO Online