iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/s00607-015-0451-z
Privacy-preserving distributed collaborative filtering | Computing Skip to main content
Springer Nature Link
Log in

Privacy-preserving distributed collaborative filtering

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We propose a new mechanism to preserve privacy while leveraging user profiles in distributed recommender systems. Our mechanism relies on two contributions: (i) an original obfuscation scheme, and (ii) a randomized dissemination protocol. We show that our obfuscation scheme hides the exact profiles of users without significantly decreasing their utility for recommendation. In addition, we precisely characterize the conditions that make our randomized dissemination protocol differentially private. We compare our mechanism with a non-private as well as with a fully private alternative. We consider a real dataset from a user survey and report on simulations as well as planetlab experiments. We dissect our results in terms of accuracy and privacy trade-offs, bandwidth consumption, as well as resilience to a censorship attack. In short, our extensive evaluation shows that our twofold mechanism provides a good trade-off between privacy and accuracy, with little overhead and high resilience.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. we use the terms ‘node’ and ‘user’ interchangeably to refer to the pair ‘user/machine’.

References

  1. Agrawal D, Aggarwal CC (2001) On the design and quantification of privacy preserving data mining algorithms. In: PODS, ACM, New York, NY, pp 247–255

  2. Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: SIGMOD, ACM, New York, NY, pp 439–450

  3. Ahmad W, Khokhar A (2007) An architecture for privacy preserving collaborative filtering on web portals. In: IAS, Manchester, pp 273–278

  4. 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–216

  5. Boutet A, Frey D, Guerraoui R, Jégou 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–752

  6. Canny J (2002) Collaborative filtering with privacy via factor analysis. In: SIGIR, ACM, New York, NY, pp 238–245

  7. Das AS, Datar M, Garg A, Rajaram S (2007) Google news personalization: scalable online collaborative filtering. In: WWW, ACM, New York, NY, pp 271–280

  8. Dwork C (2008) Differential privacy: a survey of results. In: Theory and applications of models of computation. Springer, Berlin, pp 1–19

  9. 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–284

  10. Goldreich O (2003) Cryptography and cryptographic protocols. Distrib Comput 16(2–3):177–199. doi:10.1007/s00446-002-0077-1

  11. Haeberlen A, Pierce BC, Narayan A (2011) Differential privacy under fire. In: SEC, USENIX Association, Berkeley, CA, p 33

  12. Huang Z, Du W, Chen B (2005) Deriving private information from randomized data. In: SIGMOD, ACM, New York, NY, pp 37–48

  13. 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

  14. Kargupta H, Datta S, Wang Q, Sivakumar K (2003) On the privacy preserving properties of random data perturbation techniques. In: ICDM, pp 99–106

  15. Machanavajjhala A, Korolova A, Sarma AD (2011) Personalized social recommendations: accurate or private. Proc VLDB Endow 4(7):440–450

  16. Polat H, Du W (2003) Privacy-preserving collaborative filtering using randomized perturbation techniques. In: ICDM, pp 625–628

  17. Polat H, Du W (2005) SVD-based collaborative filtering with privacy. In: SAC, ACM, New York, NY, pp 791–795

  18. Singh A, Castro M, Druschel P, Rowstron A (2004) Defending against eclipse attacks on overlay networks. In: SIGOPS, ACM, New York, NY

  19. Su X, Khoshgoftaar TM (2009) A survey of collaborative filtering techniques. Adv Artif Intell 2009:4

  20. Tarkoma S, Rothenberg CE, Lagerspetz E (2012) Theory and practice of bloom filters for distributed systems. IEEE Commun Surv Tutor 14(1):131–155

  21. van Rijsbergen CJ (1979) Information retrieval. Butterworth, Oxford

  22. Voulgaris S, Gavidia D, van Steen M (2005) CYCLON: inexpensive membership management for unstructured P2P overlays. J Netw Syst Manag 13(2):197–217. doi:10.1007/s10922-005-4441-x

  23. 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–1152

  24. Wan M, Jönsson 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–52

  25. Warner SL (1965) Randomized response: a survey technique for eliminating evasive answer bias. J Am Stat Assoc 60(309):63–69

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Rennes, Rennes, France

    Antoine Boutet, Davide Frey, Arnaud Jégou & Anne-Marie Kermarrec

  2. EPFL, Lausanne, Switzerland

    Rachid Guerraoui

Authors
  1. Antoine Boutet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Davide Frey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rachid Guerraoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Arnaud Jégou
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Anne-Marie Kermarrec
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antoine Boutet.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Boutet, A., Frey, D., Guerraoui, R. et al. Privacy-preserving distributed collaborative filtering. Computing 98, 827–846 (2016). https://doi.org/10.1007/s00607-015-0451-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-015-0451-z

Keywords

Mathematics Subject Classification

Search

Navigation