PRUB: A Privacy Protection Friend Recommendation System Based on User Behavior

The fast developing social network is a double-edged sword. It remains a serious problem to provide users with excellent mobile social network services as well as protecting privacy data. Most popular social applications utilize behavior of users to build connection with people having similar behavior, thus improving user experience. However, many users do not want to share their certain behavioral information to the recommendation system. In this paper, we aim to design a secure friend recommendation system based on the user behavior, called PRUB. The system proposed aims at achieving fine-grained recommendation to friends who share some same characteristics without exposing the actual user behavior. We utilized the anonymous data from a Chinese ISP, which records the user browsing behavior, for 3 months to test our system. The experiment result shows that our system can achieve a remarkable recommendation goal and, at the same time, protect the privacy of the user behavior information.

[1]  Guanhua Yan,et al.  Fine-grained private matching for proximity-based mobile social networking , 2012, 2012 Proceedings IEEE INFOCOM.

[2]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  Ming Li,et al.  FindU: Privacy-preserving personal profile matching in mobile social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[4]  Anna Cinzia Squicciarini,et al.  PriMa: a comprehensive approach to privacy protection in social network sites , 2014, Ann. des Télécommunications.

[5]  Jin Li,et al.  SOS: A Distributed Mobile Q&A SystemBased on Social Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[6]  Jiahui Liu,et al.  Personalized news recommendation based on click behavior , 2010, IUI '10.

[7]  Nitesh V. Chawla,et al.  Reliable medical recommendation systems with patient privacy , 2010, IHI 2010.

[8]  Richi Nayak,et al.  Improving Matching Process in Social Network Using Implicit and Explicit User Information , 2011, APWeb.

[9]  Ming Li,et al.  Privacy-Preserving Distributed Profile Matching in Proximity-Based Mobile Social Networks , 2013, IEEE Transactions on Wireless Communications.

[10]  Yehuda Lindell,et al.  Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , 2008, Journal of Cryptology.

[11]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.

[12]  Alexandre V. Evfimievski,et al.  Information sharing across private databases , 2003, SIGMOD '03.

[13]  Roger Wattenhofer,et al.  VENETA: Serverless Friend-of-Friend Detection in Mobile Social Networking , 2008, 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

[14]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[15]  Qi Xie,et al.  Privacy-preserving matchmaking For mobile social networking secure against malicious users , 2011, 2011 Ninth Annual International Conference on Privacy, Security and Trust.

[16]  Li Shundong,et al.  Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations , 2008 .

[17]  Moti Yung,et al.  Efficient robust private set intersection , 2012, Int. J. Appl. Cryptogr..

[18]  Xiaohui Liang,et al.  Secure handshake with symptoms-matching: the essential to the success of mhealthcare social network , 2010, BODYNETS.

[19]  Wei Jiang,et al.  Structural and Message Based Private Friend Recommendation , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[20]  Giancarlo Ruffo,et al.  LotusNet: Tunable privacy for distributed online social network services , 2012, Comput. Commun..

[21]  Michael Moricz,et al.  PYMK: friend recommendation at myspace , 2010, SIGMOD Conference.

[22]  Kristen LeFevre,et al.  A privacy recommendation wizard for users of social networking sites , 2010, CCS '10.