{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:46:56Z","timestamp":1773683216821,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,3,26]],"date-time":"2015-03-26T00:00:00Z","timestamp":1427328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00607-015-0451-z","type":"journal-article","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T07:50:13Z","timestamp":1427269813000},"page":"827-846","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Privacy-preserving distributed collaborative filtering"],"prefix":"10.1007","volume":"98","author":[{"given":"Antoine","family":"Boutet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Frey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"J\u00e9gou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,26]]},"reference":[{"key":"451_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal D, Aggarwal CC (2001) On the design and quantification of privacy preserving data mining algorithms. In: PODS, ACM, New York, NY, pp 247\u2013255","DOI":"10.1145\/375551.375602"},{"key":"451_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: SIGMOD, ACM, New York, NY, pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"451_CR3","doi-asserted-by":"crossref","unstructured":"Ahmad W, Khokhar A (2007) An architecture for privacy preserving collaborative filtering on web portals. In: IAS, Manchester, pp 273\u2013278","DOI":"10.1109\/IAS.2007.83"},{"key":"451_CR4","doi-asserted-by":"crossref","unstructured":"Alaggan M, Gambs S, Kermarrec A-M (2012) BLIP: non-interactive differentially-private similarity computation on bloom filters. In: Richa AW, Scheideler C (eds) Stabilization, safety, and security of distributed systems. Lecture notes in computer science, vol 7596. Springer, Berlin, pp 202\u2013216","DOI":"10.1007\/978-3-642-33536-5_20"},{"key":"451_CR5","doi-asserted-by":"crossref","unstructured":"Boutet A, Frey D, Guerraoui R, J\u00e9gou A, Kermarrec A-M (2013) WHATSUP: a decentralized instant news recommender. In: IEEE 27th international symposium on parallel distributed processing (IPDPS), Boston, MA, pp 741\u2013752","DOI":"10.1109\/IPDPS.2013.47"},{"key":"451_CR6","doi-asserted-by":"crossref","unstructured":"Canny J (2002) Collaborative filtering with privacy via factor analysis. In: SIGIR, ACM, New York, NY, pp 238\u2013245","DOI":"10.1145\/564376.564419"},{"key":"451_CR7","doi-asserted-by":"crossref","unstructured":"Das AS, Datar M, Garg A, Rajaram S (2007) Google news personalization: scalable online collaborative filtering. In: WWW, ACM, New York, NY, pp 271\u2013280","DOI":"10.1145\/1242572.1242610"},{"key":"451_CR8","doi-asserted-by":"crossref","unstructured":"Dwork C (2008) Differential privacy: a survey of results. In: Theory and applications of models of computation. Springer, Berlin, pp 1\u201319","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"451_CR9","doi-asserted-by":"crossref","unstructured":"Dwork C, McSherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. In: Halevi S, Rabin T (eds) Theory of cryptography. Lecture notes in computer science, vol 3876. Springer, Berlin, pp 265\u2013284","DOI":"10.1007\/11681878_14"},{"key":"451_CR10","doi-asserted-by":"publisher","unstructured":"Goldreich O (2003) Cryptography and cryptographic protocols. Distrib Comput 16(2\u20133):177\u2013199. doi: 10.1007\/s00446-002-0077-1","DOI":"10.1007\/s00446-002-0077-1"},{"key":"451_CR11","unstructured":"Haeberlen A, Pierce BC, Narayan A (2011) Differential privacy under fire. In: SEC, USENIX Association, Berkeley, CA, p 33"},{"key":"451_CR12","doi-asserted-by":"crossref","unstructured":"Huang Z, Du W, Chen B (2005) Deriving private information from randomized data. In: SIGMOD, ACM, New York, NY, pp 37\u201348","DOI":"10.1145\/1066157.1066163"},{"key":"451_CR13","unstructured":"Kanerva P, Kristoferson J, Holst A (2000) Random indexing of text samples for latent semantic analysis. In: CCSS, University of Pennsylvania, Philadelphia, PA, p 1036"},{"key":"451_CR14","doi-asserted-by":"crossref","unstructured":"Kargupta H, Datta S, Wang Q, Sivakumar K (2003) On the privacy preserving properties of random data perturbation techniques. In: ICDM, pp 99\u2013106","DOI":"10.1109\/ICDM.2003.1250908"},{"key":"451_CR15","doi-asserted-by":"crossref","unstructured":"Machanavajjhala A, Korolova A, Sarma AD (2011) Personalized social recommendations: accurate or private. Proc VLDB Endow 4(7):440\u2013450","DOI":"10.14778\/1988776.1988780"},{"key":"451_CR16","doi-asserted-by":"crossref","unstructured":"Polat H, Du W (2003) Privacy-preserving collaborative filtering using randomized perturbation techniques. In: ICDM, pp 625\u2013628","DOI":"10.1109\/ICDM.2003.1250993"},{"key":"451_CR17","doi-asserted-by":"crossref","unstructured":"Polat H, Du W (2005) SVD-based collaborative filtering with privacy. In: SAC, ACM, New York, NY, pp 791\u2013795","DOI":"10.1145\/1066677.1066860"},{"key":"451_CR18","doi-asserted-by":"crossref","unstructured":"Singh A, Castro M, Druschel P, Rowstron A (2004) Defending against eclipse attacks on overlay networks. In: SIGOPS, ACM, New York, NY","DOI":"10.1145\/1133572.1133613"},{"key":"451_CR19","doi-asserted-by":"crossref","unstructured":"Su X, Khoshgoftaar TM (2009) A survey of collaborative filtering techniques. Adv Artif Intell 2009:4","DOI":"10.1155\/2009\/421425"},{"key":"451_CR20","doi-asserted-by":"crossref","unstructured":"Tarkoma S, Rothenberg CE, Lagerspetz E (2012) Theory and practice of bloom filters for distributed systems. IEEE Commun Surv Tutor 14(1):131\u2013155","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"451_CR21","unstructured":"van Rijsbergen CJ (1979) Information retrieval. Butterworth, Oxford"},{"key":"451_CR22","doi-asserted-by":"publisher","unstructured":"Voulgaris S, Gavidia D, van Steen M (2005) CYCLON: inexpensive membership management for unstructured P2P overlays. J Netw Syst Manag 13(2):197\u2013217. doi: 10.1007\/s10922-005-4441-x","DOI":"10.1007\/s10922-005-4441-x"},{"key":"451_CR23","doi-asserted-by":"crossref","unstructured":"Voulgaris S, van Steen M (2005) Epidemic-style management of semantic overlays for content-based searching. In: Euro-Par 2005 parallel processing. Springer, Berlin, pp 1143\u20131152","DOI":"10.1007\/11549468_125"},{"key":"451_CR24","doi-asserted-by":"crossref","unstructured":"Wan M, J\u00f6nsson A, Wang C, Li L, Yang Y (2012) A random indexing approach for web user clustering and web prefetching. In: New frontiers in applied data mining. Springer, Berlin, pp 40\u201352","DOI":"10.1007\/978-3-642-28320-8_4"},{"issue":"309","key":"451_CR25","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"SL Warner","year":"1965","unstructured":"Warner SL (1965) Randomized response: a survey technique for eliminating evasive answer bias. J Am Stat Assoc 60(309):63\u201369","journal-title":"J Am Stat Assoc"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-015-0451-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-015-0451-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-015-0451-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:30:29Z","timestamp":1559140229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-015-0451-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,26]]},"references-count":25,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["451"],"URL":"https:\/\/doi.org\/10.1007\/s00607-015-0451-z","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,26]]}}}