{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:54:24Z","timestamp":1781913264581,"version":"3.54.5"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T00:00:00Z","timestamp":1582502400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2020,4,30]]},"abstract":"<jats:p>Recommender systems have become extremely common in recent years and are utilized in a variety of domains such as movies, music, news, products, restaurants, and so on. While a typical recommender system bases its recommendations solely on users\u2019 preference data collected by the system itself, the quality of recommendations can significantly be improved if several recommender systems (or vendors) share their data. However, such data sharing poses significant privacy and security challenges, both to the vendors and the users. In this article, we propose secure protocols for distributed item-based Collaborative Filtering. Our protocols allow to compute both the predicted ratings of items and their predicted rankings without compromising privacy nor predictions\u2019 accuracy. Unlike previous solutions in which the secure protocols are executed solely by the vendors, our protocols assume the existence of a mediator that performs intermediate computations on encrypted data supplied by the vendors. Such a mediated setting is advantageous over the non-mediated one since it enables each vendor to communicate solely with the mediator. This yields reduced communication costs, and it allows each vendor to issue recommendations to its clients without being dependent on the availability and willingness of the other vendors to collaborate.<\/jats:p>","DOI":"10.1145\/3375402","type":"journal-article","created":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T18:22:16Z","timestamp":1582568536000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Mediated Secure Multi-Party Protocols for Collaborative Filtering"],"prefix":"10.1145","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3193-5768","authenticated-orcid":false,"given":"Erez","family":"Shmueli","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[{"name":"The Open University, Ra'anana, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,2,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335438"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Jo\u00ebl Alwen Jonathan Katz Yehuda Lindell Giuseppe Persiano Abhi Shelat and Ivan Visconti. 2009. Collusion-free multiparty computation in the mediated model. In CRYPTO. 524--540.  Jo\u00ebl Alwen Jonathan Katz Yehuda Lindell Giuseppe Persiano Abhi Shelat and Ivan Visconti. 2009. Collusion-free multiparty computation in the mediated model. In CRYPTO. 524--540.","DOI":"10.1007\/978-3-642-03356-8_31"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Jo\u00ebl Alwen Abhi Shelat and Ivan Visconti. 2008. Collusion free protocols in the mediated model. In CRYPTO. 497--514.  Jo\u00ebl Alwen Abhi Shelat and Ivan Visconti. 2008. Collusion free protocols in the mediated model. In CRYPTO. 497--514.","DOI":"10.1007\/978-3-540-85174-5_28"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Abdelrahaman Aly Edouard Cuvelier Sophie Mawet Olivier Pereira and Mathieu Van Vyve. 2013. Securely solving simple combinatorial graph problems. In FC. 239--257.  Abdelrahaman Aly Edouard Cuvelier Sophie Mawet Olivier Pereira and Mathieu Van Vyve. 2013. Securely solving simple combinatorial graph problems. In FC. 239--257.","DOI":"10.1007\/978-3-642-39884-1_21"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Francesco Bonchi David Garc\u00eda-Soriano and Tamir Tassa. 2017. Secure centrality computation over multiple networks. In WWW. 957--966.  Gilad Asharov Francesco Bonchi David Garc\u00eda-Soriano and Tamir Tassa. 2017. Secure centrality computation over multiple networks. In WWW. 957--966.","DOI":"10.1145\/3038912.3052602"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"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":"10.1007\/978-3-642-29852-3_2"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Justin Brickell and Vitaly Shmatikov. 2005. Privacy preserving graph algorithms in the semi-honest model. In ASIACRYPT. 236--252.  Justin Brickell and Vitaly Shmatikov. 2005. Privacy preserving graph algorithms in the semi-honest model. In ASIACRYPT. 236--252.","DOI":"10.1007\/11593447_13"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Iv\u00e1n Cantador Ignacio Fern\u00e1ndez-Tob\u00edas Shlomo Berkovsky and Paolo Cremonesi. 2015. Cross-domain recommender systems. In Recommender Systems Handbook. 919--959.  Iv\u00e1n Cantador Ignacio Fern\u00e1ndez-Tob\u00edas Shlomo Berkovsky and Paolo Cremonesi. 2015. Cross-domain recommender systems. In Recommender Systems Handbook. 919--959.","DOI":"10.1007\/978-1-4899-7637-6_27"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Fran Casino Constantinos Patsakis Domenec Puig and Agusti Solanas. 2013. On privacy preserving collaborative filtering: Current trends open problems and new issues. In ICEBE. 244--249.  Fran Casino Constantinos Patsakis Domenec Puig and Agusti Solanas. 2013. On privacy preserving collaborative filtering: Current trends open problems and new issues. In ICEBE. 244--249.","DOI":"10.1109\/ICEBE.2013.37"},{"key":"e_1_2_1_10_1","unstructured":"Keke Chen and Ling Liu. 2005. Privacy preserving data classification with rotation perturbation. In ICDM. 589--592.  Keke Chen and Ling Liu. 2005. Privacy preserving data classification with rotation perturbation. In ICDM. 589--592."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/844102.844125"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork. 2006. Differential privacy. In ICALP (2). 1--12.  Cynthia Dwork. 2006. Differential privacy. In ICALP (2). 1--12.","DOI":"10.1007\/11787006_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1561\/1100000009"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1186\/1687-417X-2013-4"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Arik Friedman Bart Knijnenburg Kris Vanhecke Luc Martens and Shlomo Berkovsky. 2015. Privacy aspects of recommender systems. In Recommender Systems Handbook. 649--688.  Arik Friedman Bart Knijnenburg Kris Vanhecke Luc Martens and Shlomo Berkovsky. 2015. Privacy aspects of recommender systems. In Recommender Systems Handbook. 649--688.","DOI":"10.1007\/978-1-4899-7637-6_19"},{"key":"e_1_2_1_16_1","first-page":"146","article-title":"A method for privacy preserving collaborative filtering recommendations","volume":"23","author":"Georgiadis Christos K.","year":"2017","unstructured":"Christos K. Georgiadis , Nikolaos Polatidis , Haralambos Mouratidis , and Elias Pimenidis . 2017 . A method for privacy preserving collaborative filtering recommendations . The Journal of Universal Computer Science 23 (2017), 146 -- 166 . Christos K. Georgiadis, Nikolaos Polatidis, Haralambos Mouratidis, and Elias Pimenidis. 2017. A method for privacy preserving collaborative filtering recommendations. The Journal of Universal Computer Science 23 (2017), 146--166.","journal-title":"The Journal of Universal Computer Science"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"e_1_2_1_18_1","unstructured":"Tal Grinshpoun and Tamir Tassa. 2014. A privacy preserving algorithm for distributed constraint optimization. In AAMAS. 909--916.  Tal Grinshpoun and Tamir Tassa. 2014. A privacy preserving algorithm for distributed constraint optimization. In AAMAS. 909--916."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3176748.3176762"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.08.002"},{"key":"e_1_2_1_21_1","volume-title":"International Conference on Collaboration Technologies and Systems. 439--446","author":"Jeckmans Arjan","unstructured":"Arjan Jeckmans , Qiang Tang , and Pieter H. Hartel . 2012. Privacy preserving collaborative filtering based on horizontally partitioned dataset . In International Conference on Collaboration Technologies and Systems. 439--446 . Arjan Jeckmans, Qiang Tang, and Pieter H. Hartel. 2012. Privacy preserving collaborative filtering based on horizontally partitioned dataset. In International Conference on Collaboration Technologies and Systems. 439--446."},{"key":"e_1_2_1_22_1","volume-title":"McDaniel","author":"Jha Somesh","year":"2005","unstructured":"Somesh Jha , Louis Kruger , and Patrick D . McDaniel . 2005 . Privacy preserving clustering. In ESORICS. 397--417. Somesh Jha, Louis Kruger, and Patrick D. McDaniel. 2005. Privacy preserving clustering. In ESORICS. 397--417."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0008-z"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2566972.2566989"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"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":"10.1137\/1.9781611972757.43"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2993946.2993980"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Benny Pinkas. 2000. Privacy preserving data mining. In Crypto. 36--54.  Yehuda Lindell and Benny Pinkas. 2000. Privacy preserving data mining. In Crypto. 36--54.","DOI":"10.1007\/3-540-44598-6_3"},{"key":"e_1_2_1_29_1","volume-title":"Wild","author":"Mangasarian Olvi L.","year":"2008","unstructured":"Olvi L. Mangasarian and Edward W . Wild . 2008 . Privacy preserving classification of horizontally partitioned data via random kernels. In DMIN. 473--479. Olvi L. Mangasarian and Edward W. Wild. 2008. Privacy preserving classification of horizontally partitioned data via random kernels. In DMIN. 473--479."},{"key":"e_1_2_1_30_1","volume-title":"Privacy preserving classification of vertically partitioned data via random kernels. ACM Transactions on Knowledge Discovery from Data 2, 3","author":"Mangasarian Olvi L.","year":"2008","unstructured":"Olvi L. Mangasarian , Edward W. Wild , and Glenn Fung . 2008. Privacy preserving classification of vertically partitioned data via random kernels. ACM Transactions on Knowledge Discovery from Data 2, 3 ( 2008 ), 12:1--12:16. Olvi L. Mangasarian, Edward W. Wild, and Glenn Fung. 2008. Privacy preserving classification of vertically partitioned data via random kernels. ACM Transactions on Knowledge Discovery from Data 2, 3 (2008), 12:1--12:16."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.30"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"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":"10.1145\/2508859.2516751"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"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":"10.1007\/3-540-48910-X_16"},{"key":"e_1_2_1_34_1","unstructured":"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."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/10864415.2003.11044341"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Huseyin Polat and Wenliang Du. 2005. Privacy preserving collaborative filtering on vertically partitioned data. In PKDD. 651--658.  Huseyin Polat and Wenliang Du. 2005. Privacy preserving collaborative filtering on vertically partitioned data. In PKDD. 651--658.","DOI":"10.1007\/11564126_69"},{"key":"e_1_2_1_37_1","first-page":"1093","article-title":"Privacy preserving top-N recommendation on distributed data","volume":"59","author":"Polat Huseyin","year":"2008","unstructured":"Huseyin Polat and Wenliang Du . 2008 . Privacy preserving top-N recommendation on distributed data . Journal of the Association for Information Science and Technology 59 (2008), 1093 -- 1108 . Huseyin Polat and Wenliang Du. 2008. Privacy preserving top-N recommendation on distributed data. Journal of the Association for Information Science and Technology 59 (2008), 1093--1108.","journal-title":"Journal of the Association for Information Science and Technology"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.11.018"},{"key":"e_1_2_1_39_1","volume-title":"BPR: Bayesian personalized ranking from implicit feedback. In UAI. 452--461.","author":"Rendle Steffen","year":"2009","unstructured":"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."},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Badrul M. Sarwar George Karypis Joseph A. Konstan and John Riedl. 2001. Item based collaborative filtering recommendation algorithms. In WWW. 285--295.  Badrul M. Sarwar George Karypis Joseph A. Konstan and John Riedl. 2001. Item based collaborative filtering recommendation algorithms. In WWW. 285--295.","DOI":"10.1145\/371920.372071"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"J. Ben Schafer Joseph A. Konstan and John Riedl. 1999. Recommender systems in E-commerce. In EC. 158--166.  J. Ben Schafer Joseph A. Konstan and John Riedl. 1999. Recommender systems in E-commerce. In EC. 158--166.","DOI":"10.1145\/336992.337035"},{"key":"e_1_2_1_42_1","unstructured":"Assaf Schuster Ran Wolff and Bobi Gilburd. 2004. Privacy preserving association rule mining in large scale distributed systems. In CCGRID. 411--418.  Assaf Schuster Ran Wolff and Bobi Gilburd. 2004. Privacy preserving association rule mining in large scale distributed systems. In CCGRID. 411--418."},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"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\/3109859.3109881"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.41"},{"key":"e_1_2_1_45_1","unstructured":"Tamir Tassa and Francesco Bonchi. 2014. Privacy preserving estimation of social influence. In EDBT. 559--570.  Tamir Tassa and Francesco Bonchi. 2014. Privacy preserving estimation of social influence. In EDBT. 559--570."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.232"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Tamir Tassa Tal Grinshpoun and Avishay Yanai. 2019. A privacy preserving collusion secure DCOP algorithm. In IJCAI.  Tamir Tassa Tal Grinshpoun and Avishay Yanai. 2019. A privacy preserving collusion secure DCOP algorithm. In IJCAI.","DOI":"10.24963\/ijcai.2019\/663"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/3176788.3176796"},{"key":"e_1_2_1_49_1","volume-title":"Article 11","author":"Tassa Tamir","year":"2012","unstructured":"Tamir Tassa and Ehud Gudes . 2012. Secure distributed computation of anonymized views of shared databases. Transactions on Database Systems 37 , Article 11 ( 2012 ). Tamir Tassa and Ehud Gudes. 2012. Secure distributed computation of anonymized views of shared databases. Transactions on Database Systems 37, Article 11 (2012)."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2012-0007"},{"key":"e_1_2_1_51_1","unstructured":"Tamir Tassa Roie Zivan and Tal Grinshpoun. 2015. Max-sum goes private. In IJCAI. 425--431.  Tamir Tassa Roie Zivan and Tal Grinshpoun. 2015. Max-sum goes private. In IJCAI. 425--431."},{"key":"e_1_2_1_52_1","unstructured":"Tamir Tassa Roie Zivan and Tal Grinshpoun. 2016. Preserving privacy in region optimal DCOP algorithms. In IJCAI. 496--502.  Tamir Tassa Roie Zivan and Tal Grinshpoun. 2016. Preserving privacy in region optimal DCOP algorithms. In IJCAI. 496--502."},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Jaideep Vaidya and Chris Clifton. 2002. Privacy preserving association rule mining in vertically partitioned data. In KDD. 639--644.  Jaideep Vaidya and Chris Clifton. 2002. Privacy preserving association rule mining in vertically partitioned data. In KDD. 639--644.","DOI":"10.1145\/775047.775142"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2009.2016430"},{"key":"e_1_2_1_55_1","volume-title":"Arbitrarily distributed data based recommendations with privacy. Data 8 Knowledge Engineering 72","author":"Yakut Ibrahim","year":"2012","unstructured":"Ibrahim Yakut and Huseyin Polat . 2012. Arbitrarily distributed data based recommendations with privacy. Data 8 Knowledge Engineering 72 ( 2012 ), 239--256. Ibrahim Yakut and Huseyin Polat. 2012. Arbitrarily distributed data based recommendations with privacy. Data 8 Knowledge Engineering 72 (2012), 239--256."},{"key":"e_1_2_1_56_1","unstructured":"Andrew C. Yao. 1982. Protocols for secure computation. In FOCS. 160--164.  Andrew C. Yao. 1982. Protocols for secure computation. In FOCS. 160--164."},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Justin Zhijun Zhan Stan Matwin and LiWu Chang. 2005. Privacy preserving collaborative association rule mining. In Data and Applications Security. 153--165.  Justin Zhijun Zhan Stan Matwin and LiWu Chang. 2005. Privacy preserving collaborative association rule mining. In Data and Applications Security. 153--165.","DOI":"10.1007\/11535706_12"},{"key":"e_1_2_1_58_1","volume-title":"Wright","author":"Zhong Sheng","year":"2005","unstructured":"Sheng Zhong , Zhiqiang Yang , and Rebecca N . Wright . 2005 . Privacy enhancing -anonymization of customer data. In PODS. 139--147. Sheng Zhong, Zhiqiang Yang, and Rebecca N. Wright. 2005. Privacy enhancing -anonymization of customer data. In PODS. 139--147."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.07.019"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:49Z","timestamp":1750199569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,24]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4,30]]}},"alternative-id":["10.1145\/3375402"],"URL":"https:\/\/doi.org\/10.1145\/3375402","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,24]]},"assertion":[{"value":"2018-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}