Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Privacy-preserving Collaborative Filtering by Distributed Mediation

Published: 22 September 2022 Publication History

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, it would be beneficial to base recommendations on the rating data of more than one vendor. However, enlarging the training data by means of sharing information between different vendors may jeopardize the privacy of users. We devise here secure multi-party protocols that enable the practice of Collaborative Filtering (CF) in a manner that preserves the privacy of the vendors and users. Shmueli and Tassa [38] introduced privacy-preserving protocols of CF that involved a mediator; namely, an external entity 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.

References

[1]
Waseem Ahmad and Ashfaq A. Khokhar. 2007. An architecture for privacy-preserving collaborative filtering on web portals. In Proceedings of the IAS. 273–278.
[2]
Joël Alwen, Abhi Shelat, and Ivan Visconti. 2008. Collusion free protocols in the mediated model. In Proceedings of the CRYPTO. 497–514.
[3]
Gilad Asharov, Francesco Bonchi, David García-Soriano, and Tamir Tassa. 2017. Secure centrality computation over multiple networks. In Proceedings of the WWW. 957–966.
[4]
Anirban Basu, Jaideep Vaidya, and Hiroaki Kikuchi. 2012. Perturbation based privacy-preserving slope one predictors for collaborative filtering. In Proceedings of the IFIPTM. 17–35.
[5]
Anirban Basu, Jaideep Vaidya, Hiroaki Kikuchi, and Theo Dimitrakos. 2011. Privacy-preserving collaborative filtering for the cloud. In Proceedings of the CloudCom. 223–230.
[6]
Anirban Basu, Jaideep Vaidya, Hiroaki Kikuchi, and Theo Dimitrakos. 2013. Privacy-preserving collaborative filtering on the cloud and practical implementation experiences. In Proceedings of the IEEE CLOUD. 406–413.
[7]
Iván Cantador, Ignacio Fernández-Tobías, Shlomo Berkovsky, and Paolo Cremonesi. 2015. Cross-domain recommender systems. In Recommender Systems Handbook. 919–959.
[8]
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 Proceedings of the CRYPTO. 34–64.
[9]
Richard Chow, Manas A. Pathak, and Cong Wang. 2012. A practical system for privacy-preserving collaborative filtering. In Proceedings of the ICDM Workshops. 547–554.
[10]
Ivan Damgård and Jesper Buus Nielsen. 2007. Scalable and unconditionally secure multiparty computation. In Proceedings of the CRYPTO. 572–590.
[11]
Michael D. Ekstrand, John Riedl, and Joseph A. Konstan. 2011. Collaborative filtering recommender systems. Found. Trends Human-Comput. Interact. 4, 2 (2011), 175–243.
[12]
Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient private matching and set intersection. In Proceedings of the EUROCRYPT. 1–19.
[13]
David Goldberg, David A. Nichols, Brian M. Oki, and Douglas B. Terry. 1992. Using collaborative filtering to weave an information tapestry. Commun. ACM 35, 12 (1992), 61–70.
[14]
Oded Goldreich, Silvio Micali, and Avi Wigderson. 2019. How to play any mental game, or a completeness theorem for protocols with honest majority. In Providing Sound Foundations for Cryptography. 307–328.
[15]
Tal Grinshpoun and Tamir Tassa. 2014. A privacy-preserving algorithm for distributed constraint optimization. In Proceedings of the AAMAS. 909–916.
[16]
Tal Grinshpoun and Tamir Tassa. 2016. P-SyncBB: A privacy-preserving branch and bound DCOP algorithm. J. Artific. Intell. Res. 57 (2016), 621–660.
[17]
Tal Grinshpoun, Tamir Tassa, Vadim Levit, and Roie Zivan. 2019. Privacy-preserving region optimal algorithms for symmetric and asymmetric DCOPs. Artific. Intell. 266 (2019), 27–50.
[18]
Wei Jiang and Chris Clifton. 2006. A secure distributed framework for achieving \(k\)-anonymity. VLDB J. 15 (2006), 316–333.
[19]
Murat Kantarcioglu and Chris Clifton.2004. Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16 (2004), 1026–1037.
[20]
Hiroaki Kikuchi, Hiroyasu Kizawa, and Minako Tada. 2009. Privacy-preserving collaborative filtering schemes. In Proceedings of the ARES. 911–916.
[21]
Hiroaki Kikuchi and Anna Mochizuki. 2012. Privacy-preserving collaborative filtering using randomized response. In Proceedings of the IMIS. 671–676.
[22]
Donald E. Knuth. 1969. The Art of Computer Programming, Volume II: Seminumerical Algorithms. Addison-Wesley.
[23]
Thomas Léauté and Boi Faltings. 2013. Protecting privacy through distributed computation in multi-agent decision making. J. Artific. Intell. Res. 47 (2013), 649–695.
[24]
Daniel Lemire and Anna Maclachlan. 2005. Slope one predictors for online rating-based collaborative filtering. In Proceedings of the SDM. 471–475.
[25]
Yehuda Lindell and Ariel Nof. 2017. A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority. In Proceedings of the CCS. 259–276.
[26]
Burak Memis and Ibrahim Yakut. 2014. Privacy-preserving two-party collaborative filtering on overlapped ratings. KSII Trans. Internet Inf. Syst. 8 (2014), 2948–2966.
[27]
Kartik Nayak, Xiao Shaun Wang, Stratis Ioannidis, Udi Weinsberg, Nina Taft, and Elaine Shi. 2015. GraphSC: Parallel secure computation made easy. In Proceedings of the IEEE SP. 377–394.
[28]
Valeria Nikolaenko, Stratis Ioannidis, Udi Weinsberg, Marc Joye, Nina Taft, and Dan Boneh. 2013. Privacy-preserving matrix factorization. In Proceedings of the CCS. 801–812.
[29]
Takashi Nishide and Kazuo Ohta. 2007. Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In Proceedings of the PKC. 343–360.
[30]
Pascal Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of the Eurocrypt. 223–238.
[31]
François Panneton, Pierre L’Ecuyer, and Makoto Matsumoto. 2006. Improved long-period generators based on linear recurrences modulo 2. ACM Trans. Math. Softw. 32 (2006), 1–16.
[32]
Huseyin Polat and Wenliang Du. 2003. Privacy-preserving collaborative filtering using randomized perturbation techniques. In Proceedings of the ICDM. 625–628.
[33]
Tal Rabin and Michael Ben-Or. 1989. Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In Proceedings of the STOC. 73–85.
[34]
Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the UAI. 452–461.
[35]
Assaf Schuster, Ran Wolff, and Bobi Gilburd. 2004. Privacy-preserving association rule mining in large scale distributed systems. In Proceedings of the CCGRID. 411–418.
[36]
Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612–613.
[37]
Erez Shmueli and Tamir Tassa. 2017. Secure multi-party protocols for item-based collaborative filtering. In Proceedings of the RecSys. 89–97.
[38]
Erez Shmueli and Tamir Tassa. 2020. Mediated secure multi-party protocols for collaborative filtering. ACM Trans. Intell. Syst. Technol. 11, 2 (2020), 1–25.
[39]
Reza Shokri, Pedram Pedarsani, George Theodorakopoulos, and Jean-Pierre Hubaux. 2009. Preserving privacy in collaborative filtering through distributed aggregation of offline profiles. In Proceedings of the RecSys. 157–164.
[40]
Daiji Tanaka, Toshiya Oda, Katsuhiro Honda, and Akira Notsu. 2014. Privacy-preserving fuzzy co-clustering with distributed cooccurrence matrices. In Proceedings of the SCIS&ISIS. 700–705.
[41]
Tamir Tassa. 2014. Secure mining of association rules in horizontally distributed databases. IEEE Trans. Knowl. Data Eng. 26 (2014), 970–983.
[42]
Tamir Tassa and Dror J. Cohen. 2013. Anonymization of centralized and distributed social networks by sequential clustering. IEEE Trans. Knowl. Data Eng. 25 (2013), 311–324.
[43]
Tamir Tassa, Tal Grinshpoun, and Avishay Yanai. 2019. A privacy-preserving collusion secure dcop algorithm. In Proceedings of the IJCAI.
[44]
Tamir Tassa, Tal Grinshpoun, and Roie Zivan. 2017. Privacy-preserving implementation of the max-sum algorithm and its variants. J. Artific. Intell. Res. 59 (2017), 311–349.
[45]
Tamir Tassa and Ehud Gudes. 2012. Secure distributed computation of anonymized views of shared databases. Trans. Database Syst. 37, Article 11 (2012).
[46]
Tamir Tassa, Roie Zivan, and Tal Grinshpoun. 2015. Max-sum goes private. In Proceedings of the IJCAI. 425–431.
[47]
Tamir Tassa, Roie Zivan, and Tal Grinshpoun. 2016. Preserving privacy in region optimal DCOP algorithms. In Proceedings of the IJCAI. 496–502.
[48]
Jaideep Vaidya and Chris Clifton. 2002. Privacy-preserving association rule mining in vertically partitioned data. In Proceedings of the KDD. 639–644.
[49]
Udi Weinsberg, Smriti Bhagat, Stratis Ioannidis, and Nina Taft. 2012. BlurMe: Inferring and obfuscating user gender based on ratings. In Proceedings of the RecSys. 195–202.
[50]
Ibrahim Yakut and Huseyin Polat. 2012. Arbitrarily distributed data based recommendations with privacy. Data Knowl. Eng. 72 (2012), 239–256.
[51]
Andrew C. Yao. 1982. Protocols for secure computation. In Proceedings of the FOCS. 160–164.
[52]
Justin Zhijun Zhan, Stan Matwin, and LiWu Chang. 2005. Privacy-preserving collaborative association rule mining. In Proceedings of the DBSec. 153–165.
[53]
Sheng Zhong, Zhiqiang Yang, and Rebecca N. Wright. 2005. Privacy enhancing \(k\)-anonymization of customer data. In Proceedings of the PODS. 139–147.

Cited By

View all
  • (2024)Discrete Federated Multi-behavior Recommendation for Privacy-Preserving Heterogeneous One-Class Collaborative FilteringACM Transactions on Information Systems10.1145/365285342:5(1-50)Online publication date: 29-Apr-2024

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Intelligent Systems and Technology
ACM Transactions on Intelligent Systems and Technology  Volume 13, Issue 6
December 2022
468 pages
ISSN:2157-6904
EISSN:2157-6912
DOI:10.1145/3560231
  • Editor:
  • Huan Liu
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 September 2022
Online AM: 06 June 2022
Accepted: 24 May 2022
Revised: 07 April 2022
Received: 04 January 2022
Published in TIST Volume 13, Issue 6

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Recommender systems
  2. Collaborative Filtering
  3. distributed computing
  4. privacy
  5. the mediated model

Qualifiers

  • Research-article
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)28
  • Downloads (Last 6 weeks)2
Reflects downloads up to 23 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Discrete Federated Multi-behavior Recommendation for Privacy-Preserving Heterogeneous One-Class Collaborative FilteringACM Transactions on Information Systems10.1145/365285342:5(1-50)Online publication date: 29-Apr-2024

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Full Text

View this article in Full Text.

Full Text

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media