Towards Privacy-Preserving and Verifiable Federated Matrix Factorization
Xicheng Wan, Yifeng Zheng, Qun Li, Anmin Fu, Mang Su and, Yansong Gao

TL;DR
This paper introduces VPFedMF, a novel federated matrix factorization method that ensures privacy and correctness verification of shared gradients, improving security and reliability in federated recommendation systems.
Contribution
It presents a lightweight, secure aggregation scheme with verifiable correctness for federated matrix factorization, addressing privacy and trust issues in existing approaches.
Findings
Achieves privacy-preserving gradient sharing with minimal accuracy loss
Supports correctness verification of aggregation results
Demonstrates practical efficiency on real-world datasets
Abstract
Recent years have witnessed the rapid growth of federated learning (FL), an emerging privacy-aware machine learning paradigm that allows collaborative learning over isolated datasets distributed across multiple participants. The salient feature of FL is that the participants can keep their private datasets local and only share model updates. Very recently, some research efforts have been initiated to explore the applicability of FL for matrix factorization (MF), a prevalent method used in modern recommendation systems and services. It has been shown that sharing the gradient updates in federated MF entails privacy risks on revealing users' personal ratings, posing a demand for protecting the shared gradients. Prior art is limited in that they incur notable accuracy loss, or rely on heavy cryptosystem, with a weak threat model assumed. In this paper, we propose VPFedMF, a new design…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data
