Social Relation-Level Privacy Risks and Preservation in Social Recommender Systems
Xuhao Zhao, Zhongrui Zhang, Yanmin Zhu, Zhaobo Wang, Wenze Ma, Jiadi Yu, Feilong Tang
Abstract
The integration of social information into recommender systems (RSs) has gained significant popularity for enhancing recommendation performance and user experience. However, this practice introduces substantial privacy risks, particularly concerning the leakage of sensitive social relationships. While prior research has primarily focused on user-level and interaction-level privacy risks, the social relation-level privacy risks remain largely unexplored. To fill this gap, we investigate social privacy risks through membership inference attacks (MIA) and propose a Social relation-level MIA (SMIA) framework. Two key challenges arise: (1) the adversary can only access the recommended item IDs, which provide indirect and limited information about social relationships, and (2) extracting socially relevant preferences from recommendation results is inherently difficult. To tackle the first challenge, we leverage shadow models to transform sparse item IDs into dense features, enabling adversaries to effectively utilize recommendation outputs. For the second challenge, SMIA employs a dual-branch learning approach that disentangles social and behavioral preferences. Therefore, we can extract socially relevant signals from the disentangled preferences.Extensive experiments on real-world datasets demonstrate that both social and general RSs are highly vulnerable to such attacks, highlighting the urgent need for robust privacy protection mechanisms. To defend against these attacks, we introduce a Socially Adversarial Learning (SAL) defense mechanism that selectively obscures sensitive social information in user representations during training, effectively reducing privacy leakage. We further evaluate the effectiveness of our defense and discuss future directions for developing privacy-preserving mechanisms in social RSs.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 743def6d-4d4b-4bc6-9ef0-7405a99c39ddRelated papers
- Membership Inference Attacks Against Recommender SystemsMinxing Zhang, Zhaochun Ren, Zihan Wang, Pengjie Ren et al.CCS 2021 · 62 citations
- Debiasing Learning for Membership Inference Attacks Against Recommender SystemsZihan Wang, Na Huang, Fei Sun, Pengjie Ren et al.KDD 2022 · 22 citations
- Membership Inference Attacks Against Sequential Recommender SystemsZhihao Zhu, Chenwang Wu, Rui Fan, Defu Lian et al.WWW 2023 · 25 citations
- Reference Recommendation Based Membership Inference Attack Against Hybrid-Based Recommender SystemsXiaoxiao Chi, Xuyun Zhang, Yan Wang, Hongsheng Hu et al.AAAI 2026
- walk2friends: Inferring Social Links from Mobility ProfilesMichael Backes, Mathias Humbert, Jun Pang, Yang ZhangCCS 2017 · 123 citations
