PRISM: PRivacy-Aware Interest Sharing and Matching in Mobile Social Networks

In a profile matchmaking application of mobile social networks, users need to reveal their interests to each other in order to find the common interests. A malicious user may harm a user by knowing his personal information. Therefore, mutual interests need to be found in a privacy preserving manner. In this paper, we propose an efficient privacy protection and interests sharing protocol referred to as PRivacy-aware Interest Sharing and Matching (PRISM). PRISM enables users to discover mutual interests without revealing their interests. Unlike existing approaches, PRISM does not require revealing the interests to a trusted server. Moreover, the protocol considers attacking scenarios that have not been addressed previously and provides an efficient solution. The inherent mechanism reveals any cheating attempt by a malicious user. PRISM also proposes the procedure to eliminate Sybil attacks. We analyze the security of PRISM against both passive and active attacks. Through implementation, we also present a detailed analysis of the performance of PRISM and compare it with existing approaches. The results show the effectiveness of PRISM without any significant performance degradation.

[1]  Feng Xia,et al.  Safety Challenges and Solutions in Mobile Social Networks , 2013, IEEE Systems Journal.

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

[3]  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.

[4]  Justin Manweiler,et al.  SMILE: encounter-based trust for mobile social services , 2009, CCS.

[5]  Feng Xia,et al.  Event-Based Mobile Social Networks: Services, Technologies, and Applications , 2014, IEEE Access.

[6]  Landon P. Cox,et al.  SmokeScreen: flexible privacy controls for presence-sharing , 2007, MobiSys '07.

[7]  Heekuck Oh,et al.  A Trustless Broker Based Protocol to Discover Friends in Proximity-Based Mobile Social Networks , 2014, WISA.

[8]  George Varghese,et al.  MobiClique: middleware for mobile social networking , 2009, WOSN '09.

[9]  Jesper Kjeldskov,et al.  Just-for-us: a context-aware mobile information system facilitating sociality , 2005, Mobile HCI.

[10]  Yong Wang,et al.  Efficient Privacy Preserving Matchmaking for Mobile Social Networking against Malicious Users , 2012, 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications.

[11]  William G. Griswold,et al.  Peopletones: a system for the detection and notification of buddy proximity on mobile phones , 2008, MobiSys '08.

[12]  Yong Wang,et al.  Efficient privacy preserving matchmaking for mobile social networking , 2015, Concurr. Comput. Pract. Exp..

[13]  Alex Pentland,et al.  Social serendipity: mobilizing social software , 2005, IEEE Pervasive Computing.

[14]  Dusit Niyato,et al.  Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey , 2011, Proceedings of the IEEE.

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

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