Efficient privacy preserving matchmaking for mobile social networking

Discovering new friends who share common attributes, named as matchmaking, is one of the most popular applications in mobile social networking. The key security issue in matchmaking is to protect users' personal information. In this paper, we propose a novel privacy preserving matchmaking framework, which can help users to find new friends in mobile social networking without leaking their privacy information. A user (called initiator) can find the one who shares maximum number of common attributes with him (called best match) among nearby users (called candidates), and only exchange an attribute intersection set with the best match, while other candidates only know the size of the attribute intersection set mutually. The analysis and simulation results show that our protocol can resist both semi‐honest and malicious attacks while providing efficient matchmaking functionality. Copyright © 2014 John Wiley & Sons, Ltd.

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

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

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

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

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

[6]  Emiliano De Cristofaro,et al.  Privacy-Preserving Policy-Based Information Transfer , 2009, Privacy Enhancing Technologies.

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

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

[9]  Susan Hohenberger,et al.  Honest-Verifier Private Disjointness Testing Without Random Oracles , 2006, Privacy Enhancing Technologies.

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

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

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

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

[14]  Benny Pinkas,et al.  Keyword Search and Oblivious Pseudorandom Functions , 2005, TCC.

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

[16]  Emiliano De Cristofaro,et al.  Fast and Private Computation of Cardinality of Set Intersection and Union , 2012, CANS.

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

[18]  Jan Camenisch,et al.  Private Intersection of Certified Sets , 2009, Financial Cryptography.

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

[20]  Emiliano De Cristofaro,et al.  Fast and Private Computation of Set Intersection Cardinality , 2011, IACR Cryptol. ePrint Arch..

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

[22]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[23]  Qi Xie.  Privacy-Preserving Interest Matching for Mobile Social Networking , 2010 .

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

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

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

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

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

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

[30]  Elaine Shi,et al.  Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies , 2012, Public Key Cryptography.

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

[32]  Emiliano De Cristofaro,et al.  Practical Private Set Intersection Protocols with Linear Complexity , 2010, Financial Cryptography.

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

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

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