A Private and Reliable Recommendation System for Social Networks

With the proliferation of internet-based social networks into our lives, new mechanisms to control the release and use of personal data are required. As a step toward this goal, we develop a recommendation system which protects the privacy of user answers while allowing them to learn an aggregate weighted average of ratings. Due to the use of social network connections, the querier obtains a more relevant and trustworthy result than what generic anonymous recommendation systems can provide, while at the same time preserving user privacy. We also give experimental performance results for our solution and several recently developed secure computation techniques, which is of independent interest.

[1]  Wenliang Du,et al.  SVD-based collaborative filtering with privacy , 2005, SAC '05.

[2]  Jacques Stern,et al.  Sharing Decryption in the Context of Voting or Lotteries , 2000, Financial Cryptography.

[3]  Stefan Katzenbeisser,et al.  Privacy-Preserving Recommendation Systems for Consumer Healthcare Services , 2008, 2008 Third International Conference on Availability, Reliability and Security.

[4]  Ivan Damgård,et al.  Efficient, Robust and Constant-Round Distributed RSA Key Generation , 2010, TCC.

[5]  Feng Gao,et al.  A User Trust-Based Collaborative Filtering Recommendation Algorithm , 2009, ICICS.

[6]  Ilya Mironov,et al.  Differentially private recommender systems: building privacy into the net , 2009, KDD.

[7]  Martin Ester,et al.  TrustWalker: a random walk model for combining trust-based and item-based recommendation , 2009, KDD.

[8]  John F. Canny,et al.  Collaborative filtering with privacy , 2002, Proceedings 2002 IEEE Symposium on Security and Privacy.

[9]  Nitesh V. Chawla,et al.  A Private and Reliable Recommendation System Using a Social Network , 2009 .

[10]  John F. Canny,et al.  Collaborative filtering with privacy via factor analysis , 2002, SIGIR '02.

[11]  Ivan Damgård,et al.  Practical Threshold RSA Signatures without a Trusted Dealer , 2000, EUROCRYPT.

[12]  Cynthia Dwork,et al.  Differential Privacy , 2006, ICALP.

[13]  Fillia Makedon,et al.  A privacy-preserving collaborative filtering scheme with two-way communication , 2006, EC '06.

[14]  Josep Domingo-Ferrer,et al.  Privacy homomorphisms for social networks with private relationships , 2008, Comput. Networks.

[15]  Qi Wang,et al.  On the privacy preserving properties of random data perturbation techniques , 2003, Third IEEE International Conference on Data Mining.

[16]  Moti Yung,et al.  Robust efficient distributed RSA-key generation , 1998, STOC '98.

[17]  J. Golbeck,et al.  FilmTrust: movie recommendations using trust in web-based social networks , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[18]  Pim Tuyls,et al.  Efficient Binary Conversion for Paillier Encrypted Values , 2006, EUROCRYPT.

[19]  Dan Boneh,et al.  Experimenting with Shared Generation of RSA Keys , 1999, NDSS.

[20]  Matthew K. Franklin,et al.  Efficient generation of shared RSA keys , 2001, JACM.

[21]  Paolo Avesani,et al.  Trust-Aware Collaborative Filtering for Recommender Systems , 2004, CoopIS/DOA/ODBASE.

[22]  Preethi Srinivas,et al.  Key allocation schemes for private social networks , 2009, WPES '09.

[23]  Wenliang Du,et al.  Privacy-preserving collaborative filtering using randomized perturbation techniques , 2003, Third IEEE International Conference on Data Mining.

[24]  Michael Kearns,et al.  Privacy-Preserving Belief Propagation and Sampling , 2007, NIPS.

[25]  Barbara Carminati,et al.  Privacy-Aware Collaborative Access Control in Web-Based Social Networks , 2008, DBSec.

[26]  Moni Naor,et al.  Privacy preserving auctions and mechanism design , 1999, EC '99.

[27]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[28]  Yung-Ming Li,et al.  TREPPS: A Trust-based Recommender System for Peer Production Services , 2009, Expert Syst. Appl..

[29]  Rafail Ostrovsky,et al.  Secure two-party k-means clustering , 2007, CCS '07.

[30]  Nikita Borisov,et al.  FlyByNight: mitigating the privacy risks of social networking , 2008, WPES '08.

[31]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[32]  Josep Domingo-Ferrer.  A Public-Key Protocol for Social Networks with Private Relationships , 2007, MDAI.

[33]  Marina Blanton,et al.  Secure Computation of Biometric Matching , 2009 .

[34]  Cynthia Dwork,et al.  Differential Privacy: A Survey of Results , 2008, TAMC.

[35]  Maged Hamada Ibrahim,et al.  Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing , 2008, Int. J. Netw. Secur..

[36]  Ahmad-Reza Sadeghi,et al.  Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima , 2009, IACR Cryptol. ePrint Arch..

[37]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[38]  Ivan Damgård,et al.  A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.

[39]  Ivan Damgård,et al.  Practical Threshold RSA Signatures Without a Trusted Dealer , 2000 .

[40]  Mikhail J. Atallah,et al.  Private collaborative forecasting and benchmarking , 2004, WPES '04.

[41]  Tsuyoshi Takagi,et al.  A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields , 2002, ACISP.