The DOI matches its Crossref record.
Privacy Preserving Collaborative Filtering by Distributed Mediation
Abstract
Recommender systems have become very influential in our everyday decision making, e.g., helping us choose a movie from a content platform, or offering us suitable products on e-commerce websites. While most vendors who utilize recommender systems rely exclusively on training data consisting of past transactions that took place through them, the accuracy of recommendations can be improved if several vendors conjoin their datasets. Alas, such data sharing poses grave privacy concerns for both the vendors and the users. In this study we present secure multi-party protocols that enable several vendors to share their data, in a privacy-preserving manner, in order to allow more accurate Collaborative Filtering (CF). Shmueli and Tassa (RecSys 2017) introduced privacy-preserving CF protocols that rely on a mediator; namely, a third party that assists in performing the computations. They demonstrated the significant advantages of mediation in that context. We take here the mediation approach into the next level by using several independent mediators. Such distributed mediation maintains all of the advantages that were identified by Shmueli and Tassa, and offers additional ones, in comparison with the single-mediator protocols: stronger security and dramatically shorter runtimes. In addition, while all prior art assumed limited and unrealistic settings, in which each user can purchase any given item through only one vendor, we consider here a general and more realistic setting, which encompasses all previously considered settings, where users can choose between different competing vendors. We demonstrate the appealing performance of our protocols through extensive experimentation.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
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?
In the citing paper
“SMC relies on cryptographic techniques such as secret sharing [129, 133] and homomorphic encryption [6, 134] to ensure input confidentiality during computation.”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [129]
In the citing paper
“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 [129]
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 25
- Waseem Ahmad and Ashfaq A. Khokhar . 2007 . An Architecture for Privacy Preserving Collaborative Filtering on Web Portals. In The Third International Symposium on Information Assurance and Security, IAS. 273–278 . Waseem Ahmad and Ashfaq A. Khokhar. 2007. An Architecture for Privacy Preserving Collaborative Filtering on Web Portals. In The Third International Symposium on Information Assurance and Security, IAS. 273–278.
- Joël Alwen Abhi Shelat and Ivan Visconti. 2008. Collusion Free Protocols in the Mediated Model. In CRYPTO. 497–514. Joël Alwen Abhi Shelat and Ivan Visconti. 2008. Collusion Free Protocols in the Mediated Model. In CRYPTO. 497–514. · DOI
- Anirban Basu Jaideep Vaidya and Hiroaki Kikuchi. 2012. Perturbation Based Privacy Preserving Slope One Predictors for Collaborative Filtering. In IFIPTM. 17–35. Anirban Basu Jaideep Vaidya and Hiroaki Kikuchi. 2012. Perturbation Based Privacy Preserving Slope One Predictors for Collaborative Filtering. In IFIPTM. 17–35. · DOI
- Anirban Basu Jaideep Vaidya Hiroaki Kikuchi and Theo Dimitrakos. 2011. Privacy-preserving Collaborative Filtering for the Cloud. In CloudCom. 223–230. Anirban Basu Jaideep Vaidya Hiroaki Kikuchi and Theo Dimitrakos. 2011. Privacy-preserving Collaborative Filtering for the Cloud. In CloudCom. 223–230. · DOI
- Anirban Basu , Jaideep Vaidya , Hiroaki Kikuchi , and Theo Dimitrakos . 2013. Privacy-Preserving Collaborative Filtering on the Cloud and Practical Implementation Experiences . In IEEE CLOUD. 406–413. Anirban Basu, Jaideep Vaidya, Hiroaki Kikuchi, and Theo Dimitrakos. 2013. Privacy-Preserving Collaborative Filtering on the Cloud and Practical Implementation Experiences. In IEEE CLOUD. 406–413.
- Iván Cantador Ignacio Fernández-Tobías Shlomo Berkovsky and Paolo Cremonesi. 2015. Cross-Domain Recommender Systems. In Recommender Systems Handbook. 919–959. Iván Cantador Ignacio Fernández-Tobías Shlomo Berkovsky and Paolo Cremonesi. 2015. Cross-Domain Recommender Systems. In Recommender Systems Handbook. 919–959. · DOI
- Koji Chida Daniel Genkin Koki Hamada Dai Ikarashi Ryo Kikuchi Yehuda Lindell and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In CRYPTO. 34–64. Koji Chida Daniel Genkin Koki Hamada Dai Ikarashi Ryo Kikuchi Yehuda Lindell and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In CRYPTO. 34–64. · DOI
- 10.1109/ICDMW.2012.84 · DOI
- 10.1561/1100000009 · DOI
- 10.1145/138859.138867 · DOI
- Hiroaki Kikuchi Hiroyasu Kizawa and Minako Tada. 2009. Privacy-Preserving Collaborative Filtering Schemes. In ARES. 911–916. Hiroaki Kikuchi Hiroyasu Kizawa and Minako Tada. 2009. Privacy-Preserving Collaborative Filtering Schemes. In ARES. 911–916. · DOI
- Daniel Lemire and Anna Maclachlan. 2005. Slope One Predictors for Online Rating-Based Collaborative Filtering. In SDM. 471–475. Daniel Lemire and Anna Maclachlan. 2005. Slope One Predictors for Online Rating-Based Collaborative Filtering. In SDM. 471–475. · DOI
- Burak Memis and Ibrahim Yakut . 2014 . Privacy-Preserving Two-Party Collaborative Filtering on Overlapped Ratings . KSII Trans. Internet Inf. Syst. 8 (2014), 2948 – 2966 . Burak Memis and Ibrahim Yakut. 2014. Privacy-Preserving Two-Party Collaborative Filtering on Overlapped Ratings. KSII Trans. Internet Inf. Syst. 8 (2014), 2948–2966.
- Kartik Nayak , Xiao Shaun Wang , Stratis Ioannidis , Udi Weinsberg , Nina Taft , and Elaine Shi . 2015 . GraphSC: Parallel Secure Computation Made Easy. In IEEE Symposium on Security and Privacy. 377–394 . Kartik Nayak, Xiao Shaun Wang, Stratis Ioannidis, Udi Weinsberg, Nina Taft, and Elaine Shi. 2015. GraphSC: Parallel Secure Computation Made Easy. In IEEE Symposium on Security and Privacy. 377–394.
- Valeria Nikolaenko Stratis Ioannidis Udi Weinsberg Marc Joye Nina Taft and Dan Boneh. 2013. Privacy Preserving Matrix Factorization. In CCS. 801–812. Valeria Nikolaenko Stratis Ioannidis Udi Weinsberg Marc Joye Nina Taft and Dan Boneh. 2013. Privacy Preserving Matrix Factorization. In CCS. 801–812. · DOI
- Takashi Nishide and Kazuo Ohta. 2007. Multiparty Computation for Interval Equality and Comparison Without Bit-Decomposition Protocol. In PKC. 343–360. Takashi Nishide and Kazuo Ohta. 2007. Multiparty Computation for Interval Equality and Comparison Without Bit-Decomposition Protocol. In PKC. 343–360. · DOI
- Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Eurocrypt. 223–238. Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Eurocrypt. 223–238. · DOI · Paper page
- Huseyin Polat and Wenliang Du. 2003. Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques. In ICDM. 625–628. Huseyin Polat and Wenliang Du. 2003. Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques. In ICDM. 625–628.
- Steffen Rendle , Christoph Freudenthaler , Zeno Gantner , and Lars Schmidt-Thieme . 2009 . BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI. 452–461. Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI. 452–461.
- 10.1145/359168.359176 · DOI · Paper page
- Erez Shmueli and Tamir Tassa. 2017. Secure Multi-Party Protocols for Item-Based Collaborative Filtering. In RecSys. 89–97. Erez Shmueli and Tamir Tassa. 2017. Secure Multi-Party Protocols for Item-Based Collaborative Filtering. In RecSys. 89–97. · DOI
- 10.1145/3375402 · DOI
- Daiji Tanaka Toshiya Oda Katsuhiro Honda and Akira Notsu. 2014. Privacy preserving fuzzy co-clustering with distributed cooccurrence matrices. In SCIS&ISIS. 700–705. Daiji Tanaka Toshiya Oda Katsuhiro Honda and Akira Notsu. 2014. Privacy preserving fuzzy co-clustering with distributed cooccurrence matrices. In SCIS&ISIS. 700–705. · DOI
- Udi Weinsberg Smriti Bhagat Stratis Ioannidis and Nina Taft. 2012. BlurMe: inferring and obfuscating user gender based on ratings. In RecSys. 195–202. Udi Weinsberg Smriti Bhagat Stratis Ioannidis and Nina Taft. 2012. BlurMe: inferring and obfuscating user gender based on ratings. In RecSys. 195–202. · DOI
- 10.1016/j.datak.2011.11.002 · DOI
Cited by
Sorted by citations
Roy, F., Ding, X., Choo, K. K. R., & Zhou, P. (2024) · arXiv · doi:10.48550/arxiv.2409.12651 · Cited by 7
Metadata
- Authors
- Ben Horin, A., & Tassa, T.
- Affiliations
- Mathematics and Computer Science, The Open University, Israel
- Open University of Israel (IL)
- ORCID
- Tassa, Tamir
- Venue
- Fifteenth ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2021-09-13
- Pages
- 332-341
- OpenAlex
- W3200543535
- Cited by
- 8
- References
- 0
- Citations by year
- 2024: 2 · 2023: 5 · 2022: 1
- FWCI
- 0.92
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM Conference on Recommender Systems (RecSys) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Keywords
- privacy-preserving collaborative filtering, secure multi-party computation, recommender systems, recommendation accuracy, user privacy
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