User Consented Federated Recommender System Against Personalized Attribute Inference Attack
Open accessAbstract
Recommender systems can be privacy-sensitive. To protect users' private historical interactions, federated learning has been proposed in distributed learning for user representations. Using federated recommender (FedRec) systems, users can train a shared recommendation model on local devices and prevent raw data transmissions and collections. However, the recommendation model learned by a common FedRec may still be vulnerable to private information leakage risks, particularly attribute inference attacks, which means that the attacker can easily infer users' personal attributes from the learned model. Additionally, traditional FedRecs seldom consider the diverse privacy preference of users, leading to difficulties in balancing the recommendation utility and privacy preservation. Consequently, FedRecs may suffer from unnecessary recommendation performance loss due to over-protection and private information leakage simultaneously. In this work, we propose a novel user-consented federated recommendation system (UC-FedRec) to flexibly satisfy the different privacy needs of users by paying a minimum recommendation accuracy price. UC-FedRec allows users to self-define their privacy preferences to meet various demands and makes recommendations with user consent. Experiments conducted on different real-world datasets demonstrate that our framework is more efficient and flexible compared to baselines. Our code is available at https://github.com/HKUST-KnowComp/UC-FedRec.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Various privacy preservation methodologies, such as randomization, differential privacy, secure multiparty computation, and homomorphic encryption, can be applied to build decentralized PPRS.
“To address these vulnerabilities, various privacy preservation methodologies, such as randomization, differential privacy, secure multiparty computation, and homomorphic encryption, can be applied to build decentralized PPRS [14, 129-132, 138, 139, 141].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [139]
Decentralized recommender systems remain vulnerable to threats such as inference attacks and differential attacks.
“Although decentralized RS inherently provides a privacy protocol, as users preserve their entire historical data, and even FedRec prioritizes user privacy over DCS, it remains vulnerable to threats such as inference attacks and differential attacks [105, 138-142].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [139]
Cites
Fair prediction with disparate impact: a study of bias in recidivism prediction instruments
Chouldechova, A. (2017) · Big Data · doi:10.1089/big.2016.0047 · Cited by 2,159 · see citing works
"You Might Also Like:" Privacy Risks of Collaborative Filtering
Calandrino, J. A., Kilzer, A., Narayanan, A., Felten, E. W., & Shmatikov, V. (2011) · 2011 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2011.40 · Cited by 311 · see citing works
Privacy-Aware Recommendation with Private-Attribute Protection using Adversarial Learning
Beigi, G., Mosallanezhad, A., Guo, R., Alvari, H., Nou, A., & Liu, H. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371832 · Cited by 80 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Roy, F., Ding, X., Choo, K. K. R., & Zhou, P. (2024) · arXiv · doi:10.48550/arxiv.2409.12651
- Authors
- Hu, Q., & Song, Y.
- Affiliations
- Hong Kong University of Science and Technology (HK)
- ORCID
- Venue
- Proceedings of the 17th ACM International Conference on Web Search and Data Mining
- Publisher
- ACM
- Published
- 2024-03-04
- Pages
- 276-285
- OpenAlex
- W4390436845
- Cited by
- 17
- References
- 3
- Citations by year
- 2026: 2 · 2025: 13 · 2024: 2
- FWCI
- 4.91
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- ACM International Conference on Web Search and Data Mining (WSDM) (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- arXiv (Cornell University)
- Funders
- UGC Research Matching Grants (RMGS20EG01-D, RMGS20CR11, RMGS20CR12, RMGS20EG19, RMGS20EG21, RMGS23CR05, RMGS23EG08)
- GRF (16211520,16205322)
- RIF (R6020-19,R6020-20)
- NSFC (U20B2053)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
- Keywords
- federated recommender systems, attribute inference attacks, privacy preservation, user consent, user representation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review