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.
KeywordsProfile matching Privacy-preserving Information exchange Asymmetric scalar-preserving encryption PMSNs
This work is supported by the National Natural Science Foundation of China under Grant No. 61103035 and the Science and Technology Program of Hunan Province under Grant No. 2014GK3029.
- 3.Dong, W., Dave, V., Qiu, L., Zhang, Y.: Secure friend discovery in mobile social networks. In: 2011 IEEE INFOCOM, pp. 1647–1655. IEEE (2011)Google Scholar
- 5.Ioannidis, I., Grama, A., Atallah, M.J.: A secure protocol for computing dotproducts in clustered and distributed environments. In: Proceedings of 2002 International Conference on Parallel Processing, pp. 379–384. IEEE (2002)Google Scholar
- 7.Li, M., Cao, N., Yu, S., Lou, W.: FindU: privacy-preserving personal profile matching in mobile social networks. In: 2011 IEEE INFOCOM, pp. 2435–2443. IEEE (2011)Google Scholar
- 11.Manweiler, J., Scudellari, R., Cox, L.P.: Smile: encounter-based trust for mobile social services. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, pp. 246–255. ACM (2009)Google Scholar
- 12.Pietiläinen, A.K., Oliver, E., LeBrun, J., Varghese, G., Diot, C.: MobiClique: middleware for mobile social networking. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, pp. 49–54. ACM (2009)Google Scholar
- 13.Rane, S., Sun, W., Vetro, A.: Privacy-preserving approximation of L1 distance for multimedia applications. In: 2010 IEEE International Conference on Multimedia and Expo (ICME), pp. 492–497 (2010)Google Scholar
- 15.Von Arb, M., Bader, M., Kuhn, M., Wattenhofer, R.: VENETA: serverless friend-of-friend detection in mobile social networking. In: IEEE International Conference on Wireless and Mobile Computing Networking and Communications (WIMOB 08), pp. 184–189. IEEE (2008)Google Scholar
- 17.Wang, Y., Xu, J.: Overview on privacy-preserving profile-matching mechanisms in mobile social networks in proximity (MSNP). In: 2014 Ninth Asia Joint Conference on Information Security (ASIA JCIS), pp. 133–140. IEEE (2014)Google Scholar
- 18.Xie, Q., Hengartner, U.: Privacy-preserving matchmaking for mobile social networking secure against malicious users. In: 2011 Ninth Annual International Conference on Privacy, Security and Trust (PST), pp. 252–259. IEEE (2011)Google Scholar