Efficient Private Matching Scheme for Friend Information Exchange

In the recent years, with the rapid development of social networks and mobile devices, mobile users can exchange the information and find the potential friends in vicinity through comparing the similarity degree between their personal attributes and make a connection via Wi-Fi/Bluetooth. The personal attributes, however, usually contain some private information, and users are not willing to reveal these to others in the process of friend discovery. In this paper, we proposed a novel efficient private matching scheme, which adopts an asymmetric scalar-preserving encryption according to the idea of k-nearest neighbor (kNN) queries. The personal profile of users will be processed in different ways, which is not recoverable. Moreover, our scheme relies on no Trusted Third Party (TTP). Detailed security and performance analysis demonstrate that our scheme can protect users’ private information and resist outside attack during the matching process.

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

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

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

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

[5]  Guanhua Yan,et al.  Privacy-Preserving Profile Matching for Proximity-Based Mobile Social Networking , 2013, IEEE Journal on Selected Areas in Communications.

[6]  Anthony Vetro,et al.  Privacy-preserving approximation of L1 distance for multimedia applications , 2010, 2010 IEEE International Conference on Multimedia and Expo.

[7]  Xiaodong Lin,et al.  SPOC: A Secure and Privacy-Preserving Opportunistic Computing Framework for Mobile-Healthcare Emergency , 2013, IEEE Transactions on Parallel and Distributed Systems.

[8]  Xiaohui Liang,et al.  A Secure Handshake Scheme with Symptoms-Matching for mHealthcare Social Network , 2011, Mob. Networks Appl..

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

[10]  Dan Boneh,et al.  Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.

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

[12]  Jie Wu,et al.  Time-based proxy re-encryption scheme for secure data sharing in a cloud environment , 2014, Inf. Sci..

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

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

[15]  Song Guo,et al.  Neighbor Similarity Trust against Sybil Attack in P2P E-Commerce , 2015, IEEE Trans. Parallel Distributed Syst..

[16]  Mikhail J. Atallah,et al.  A secure protocol for computing dot-products in clustered and distributed environments , 2002, Proceedings International Conference on Parallel Processing.

[17]  Jing Xu,et al.  Overview on Privacy-Preserving Profile-Matching Mechanisms in Mobile Social Networks in Proximity (MSNP) , 2014, 2014 Ninth Asia Joint Conference on Information Security.

[18]  Hong Shen,et al.  Efficient and secure protocols for privacy-preserving set operations , 2009, TSEC.

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