Efficient Privacy Preserving Matchmaking for Mobile Social Networking against Malicious Users

Making friends with some common attributes is one of the most popular applications in the mobile social networking (MSN). However, how to preserve the users' privacy while matchmaking has been considered as the key security issue for such applications. In this paper, based on the definitions of the privacy level, a new privacy preserving matchmaking system and protocol for MSN is proposed, which can help users to find their friends without leaking their privacy information. A user (called initiator) can find the best match among the candidates, and only exchange attributes intersection set with the best matched, while other users only know the size of the attributes intersection set mutually. The analyzing and simulation results show that our protocol is efficient with the ability to resist the semi-honest and malicious attacks while providing higher matchmaking efficiency.

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

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

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

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

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

[6]  Chris Clifton,et al.  Secure set intersection cardinality with application to association rule mining , 2005, J. Comput. Secur..

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

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

[9]  Ron Steinfeld,et al.  Efficient Fuzzy Matching and Intersection on Private Datasets , 2009, ICISC.

[10]  C. Pandu Rangan,et al.  Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security , 2009, CANS.

[11]  Xiaomin Liu,et al.  Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection , 2009, TCC.

[12]  Xiaomin Liu,et al.  Fast Secure Computation of Set Intersection , 2010, SCN.

[13]  Dong Xuan,et al.  E-SmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[14]  Emiliano De Cristofaro,et al.  (If) Size Matters: Size-Hiding Private Set Intersection , 2011, IACR Cryptol. ePrint Arch..

[15]  Emiliano De Cristofaro,et al.  Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model , 2010, ASIACRYPT.

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

[17]  Yin Zhang,et al.  Secure friend discovery in mobile social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[18]  Emiliano De Cristofaro,et al.  Reclaiming privacy for smartphone applications , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications (PerCom).

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

[20]  Carmit Hazay,et al.  Efficient Set Operations in the Presence of Malicious Adversaries , 2010, Journal of Cryptology.

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