A private and reliable recommendation system for social networks

Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust

Volumn , Issue , 2010, Pages 816-825

  Hoens, T Ryan ^a   Blanton, Marina ^a   Chawla, Nitesh V ^b  

^a University of Notre Dame   (United States)

^b UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET BASED; NEW MECHANISMS; PERSONAL DATA; RECOMMENDATION SYSTEMS; SECURE COMPUTATION; SOCIAL NETWORKS; USER PRIVACY; WEIGHTED AVERAGES;

CRYPTOGRAPHY;

SOCIAL NETWORKING (ONLINE);

EID: 78649262814     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SocialCom.2010.124     Document Type: Conference Paper

References (40)

1. M. Atallah, M. Bykova, J. Li, K. Frikken, and M. Topkara, "Private collaborative forecasting and benchmarking," in ACM Workshop on Privacy in the Electronic Society (WPES), 2004, pp. 103-114.
2. P. Bunn and R. Ostrovsky, "Secure two-party k-means clustering," in ACM Conference on Computer and Communications Security (CCS), 2007, pp. 486-497.
3. M. Blanton and M. Aliasgari, "Secure computation of biometric matching," Department of Computer Science and Engineering, University of Notre Dame, Tech. Rep. 2009-03, 2009.
4. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Advances in Cryptology - EUROCRYPT, ser. LNCS, vol. 1592, 1999, pp. 223-238.
5. P.-A. Fouque, G. Poupard, and J. Stern, "Sharing decryption in the context of voting or lotteries," in International Conference on Financial Cryptography (FC), ser. LNCS, vol. 1962, 2000, pp. 90-104.
6. I. Damg̊ard and M. Jurik, "A generalisation, a simplification and some applications of Paillier's probabilistic public-key system," in International Workshop on Practice and Theory in Public Key Cryptography (PKC), 2001, pp. 119-136.
7. D. Boneh and M. Franklin, "Efficient generation of shared RSA keys," Journal of the ACM, vol. 48, no. 4, pp. 702-722, 2001.
8. I. Damg̊ard and M. Koprowski, "Practical threshold RSA signatures without a trusted dealer," in Advances in Cryptology - EUROCRYPT, ser. LNCS, vol. 2045, 2001, pp. 152-165.
9. T. R. Hoens, M. Blanton, and N. Chawla, "A private and reliable recommendation system using a social network," Department of Computer Science and Engineering, University of Notre Dame, Tech. Rep. 2010-05, 2010.
10. B. Schoenmakers and P. Tuyls, "Efficient binary conversion for Paillier encrypted values," in Advances in Cryptology - EUROCRYPT, ser. LNCS, vol. 4004, 2006, pp. 522-537.
11. M. Malkin, T. Wu, and D. Boneh, "Experimenting with shared generation of RSA keys," in Symposium on Network and Distributed System Security (NDSS), 1999, pp. 43-56.
12. Y. Frankel, P. MacKenzie, and M. Yung, "Robust efficient distributed RSA-key generation," in ACM Symposium on Theory of Computing (STOC), 1998, pp. 663-672.
13. M. Ibrahim, "Eliminating quadratic slowdown in two-prime RSA function sharing," International Journal of Network Security (IJNS), vol. 7, no. 1, pp. 106-113, 2008.
14. I. Biehl and T. Takagi, "A new distributed primality test for shared RSA keys using quadratic fields," in Australasian Conference on Information Security and Privacy (ACISP), 2002, pp. 1-16.
15. I. Damg̊ard and G. Mikkelsen, "Efficient, robust and constant-round distributed RSA key generation," in Theory of Cryptography Conference (TCC), 2010, pp. 183-200.
16. M. Jamali and M. Ester, "Trustwalker: a random walk model for combining trust-based and item-based recommendation," in ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2009, pp. 397-406.
17. J. Golbeck and J. Hendler, "FilmTrust: Movie recommendations using trust in web-based social networks," in IEEE Consumer Communications and Networking Conference (CCNC), 2006, pp. 282-286.
18. P. Massa and P. Avesani, "Trust-aware collaborative filtering for recommender systems," in International Conference on Cooperative Information Systems (CoopIS), ser. LNCS, vol. 3290, 2004, pp. 492-508.
19. Y.-M. Li and C.-P. Kao, "TREPPS: A trust-based recommender system for peer production services," Expert Systems with Applications (ESWA), vol. 36, no. 2, pp. 3263-3277, 2009.
20. F. Zhang, L. Bai, and F. Gao, "A user trust-based collaborative filtering recommendation algorithm," in International Conference on Information and Communications Security (ICICS), 2009, pp. 411-424.
21. S. Katzenbeisser and M. Petkovic, "Privacy-preserving recommendation systems for consumer healthcare services," in International Conference on Availability, Reliability and Security (ARES), 2008, pp. 889-895.
22. J. Canny, "Collaborative filtering with privacy," in IEEE Symposium on Security and Privacy, 2002, pp. 45-57.
23. -, "Collaborative filtering with privacy via factor analysis," in ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), 2002, pp. 238-245.
24. H. Polat and W. Du, "Privacy-preserving collaborative filtering using randomized perturbation techniques," in IEEE International Conference on Data Mining (ICDM), 2003, pp. 625-628.
25. -, "SVD-based collaborative filtering with privacy," in ACM Symposium on Applied Computing (SAC), vol. 1, 2005, pp. 791-795.
26. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar, "On the privacy preserving properties of random data perturbation techniques," in IEEE International Conference on Data Mining (ICDM), 2003, pp. 99-106.
27. S. Zhang, J. Ford, and F. Makedon, "A privacy-preserving collaborative filtering scheme with two-way communication," in ACM Conference on Electronic Commerce (EC), 2006, pp. 316-323.
28. B. Carminati and E. Ferrari, "Privacy-aware collaborative access control in web-based social networks," in IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy (DBSec), ser. LNCS, vol. 5094, 2008, pp. 81-96.
29. J. Domingo-Ferrer, "A public-key protocol for social networks with private relationships," in Modeling Decisions for Artifical Intelligence (MDAI), ser. LNCS, vol. 4617, 2007, pp. 373-379.
30. M. Lucas and N. Borisov, "FlyByNight: Mitigating the privacy risks of social networking," in ACM Workshop on Privacy in the Electronic Society (WPES), 2008, pp. 1-8.
31. J. Domingo-Ferrer, A. Viejo, F. Sebe, and U. Gonzalez-Nicolas, "Privacy homomorphisms for social networks with private relationships," Computer Networks (CN), vol. 52, no. 15, pp. 3007-3016, 2008.
32. K. Frikken and P. Srinivas, "Key allocation schemes for private social networks," in ACM Workshop on Privacy in the Electronic Society (WPES), 2009, pp. 11-20.
33. C. Dwork, "Differential privacy," in International Colloquium on Automata, Languages and Programming (ICALP), ser. LNCS, vol. 4052, 2006, pp. 1-12.
34. -, "Differential privacy: A survey of results," in International Conference on Theory and Applications of Models of Computation (TAMC), ser. LNCS, vol. 4978, 2008, pp. 1-19.
35. F. McSherry and I. Mironov, "Differentially private recommender systems: Building privacy into the Netflix prize contenders," in ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2009, pp. 627-636.
36. M. Kearns, J. Tan, and J. Wortman, "Privacy-preserving belief propagation and sampling," in Advances in Neural Information Processing Systems (NIPS), 2007.
37. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider, "Improved garbled circuit building blocks and applications to auctions and computing minima," in Cryptology and Network Security (CANS), 2009, pp. 1-20.
38. A. Yao, "How to generate and exchange secrets," in IEEE Symposium on Foundations of Computer Science (FOCS), 1986, pp. 162-167.
39. M. Naor, B. Pinkas, and R. Sumner, "Privacy preserving auctions and mechanism design," in ACM Conference on Electronic Commerce (EC), 1999, pp. 129-139.
40. M. Ben-Or, S. Goldwasser, and A. Widgerson, "Completeness theorems for non-cryptographic fault tolerant distributed computation," in ACM Symposium on Theory of Computing (STOC), 1988, pp. 1-10.