Matrix Sketching for Secure Collaborative Machine Learning
Not on the map. Why?
Abstract (arXiv)
Collaborative learning allows participants to jointly train a model without data sharing. To update the model parameters, the central server broadcasts model parameters to the clients, and the clients send updating directions such as gradients to the server. While data do not leave a client device, the communicated gradients and parameters will leak a client's privacy. Attacks that infer clients' privacy from gradients and parameters have been developed by prior work. Simple defenses such as dropout and differential privacy either fail to defend the attacks or seriously hurt test accuracy. We propose a practical defense which we call Double-Blind Collaborative Learning (DBCL). The high-level idea is to apply random matrix sketching to the parameters (aka weights) and re-generate random sketching after each iteration. DBCL prevents clients from conducting gradient-based privacy inferences which are the most effective attacks. DBCL works because from the attacker's perspective, sketching is effectively random noise that outweighs the signal. Notably, DBCL does not much increase computation and communication costs and does not hurt test accuracy at all.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 2; 2025: 1.
7 papers.
- 2022Survey on Federated Learning Threats: concepts, taxonomy on attacks and defences, experimental study and challengescited by 84
- 2023Privacy and Fairness in Federated Learning: on the Perspective of Trade-offcited by 26
- 2023A Survey of What to Share in Federated Learning: Perspectives on Model Utility, Privacy Leakage, and Communication Efficiencycited by 21
- 2023FedREP: A Byzantine-Robust, Communication-Efficient and Privacy-Preserving Framework for Federated Learningcited by 4
- 2024When Swarm Learning meets energy series data: A decentralized collaborative learning design based on blockchaincited by 0
- 2024Subword Embedding from Bytes Gains Privacy without Sacrificing Accuracy and Complexitycited by 0
- 2025A Service-Oriented Adaptive Hierarchical Incentive Mechanism for Federated Learningcited by 0
- 2025A Service-Oriented Adaptive Hierarchical Incentive Mechanism for Federated Learning3 Sep 2025
- 2024Subword Embedding from Bytes Gains Privacy without Sacrificing Accuracy and Complexity21 Oct 2024
- 2024When Swarm Learning meets energy series data: A decentralized collaborative learning design based on blockchain7 Jun 2024
- 2023A Survey of What to Share in Federated Learning: Perspectives on Model Utility, Privacy Leakage, and Communication Efficiency20 Jul 2023
- 2023Privacy and Fairness in Federated Learning: on the Perspective of Trade-off25 Jun 2023
- 2023FedREP: A Byzantine-Robust, Communication-Efficient and Privacy-Preserving Framework for Federated Learning9 Mar 2023
- 2022Survey on Federated Learning Threats: concepts, taxonomy on attacks and defences, experimental study and challenges20 Jan 2022