NMHP: A Privacy Preserving Profile Matching Protocol in Multi-hop Proximity Mobile Social Networks

  • Entao Luo
  • Qin Liu
  • Guojun WangEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9530)


With the rapid development of mobile devices and online social networks, users in Proximity-based Mobile Social Networks (PMSNs) can easily discover and make new social interactions with others by profile matching. The profiles usually contain sensitive personal information, while the emerging requirement of profile matching in proximity mobile social networks may occasionally leak the sensitive information and hence violate people’s privacy. In this paper, we propose a multi-hop profile matching protocol (NMHP) in PMSNs. By using our protocol, users can customize the matching matrices to involve their own matching preference and to make the matching results more precise. In addition, to achieve a secure and efficient matching, we utilize the confusion matrix transformation and the idea of multi-hop, which means we make profile matching within several hops instead one. Security analysis shows that our proposed protocol can realize privacy-preserving friend discovery with higher efficiency.


Profile matching Friend discovery Trusted third party Confusion matrix Dot production 



This work is supported in part by the National Natural Science Foundation of China under Grant Numbers 61272151, 61472451 and 61402161, the International Science & Technology Cooperation Program of China under Grant Number 2013DFB10070, the China Hunan Provincial Science & Technology Program under Grant Number 2012GK4106, the Hunan Provincial Education Department of China under grant number 2015C0589. and the “Mobile Health” Ministry of Education - China Mobile Joint Laboratory (MOE-DST No. [2012]311).


  1. 1.
    Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  2. 2.
    De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 213–231. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  3. 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
  4. 4.
    Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004) CrossRefGoogle Scholar
  5. 5.
    Ioannidis, I., Grama, A., Atallah, M.J.: A secure protocol for computing dotproducts in clustered and distributed environments. In: Proceedings of the 2002 International Conference on Parallel Processing, pp. 379–384. IEEE (2002)Google Scholar
  6. 6.
    Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  7. 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
  8. 8.
    Lu, R., Lin, X., Liang, X., Shen, X.: A secure handshake scheme with symptomsmatching for mhealthcare social network. Mob. Netw. Appl. 16(6), 683–694 (2011)CrossRefGoogle Scholar
  9. 9.
    Lu, R., Lin, X., Shen, X.: Spoc: a secure and privacy-preserving opportunistic computing framework for mobile-healthcare emergency. IEEE Trans. Parallel Distrib. Syst. 24(3), 614–624 (2013)CrossRefGoogle Scholar
  10. 10.
    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
  11. 11.
    Niu, B., Zhu, X., Liu, J., Li, Z., Li, H.: Weight-aware private matching scheme for proximity-based mobile social networks. In: 2013 IEEE Global Communications Conference (GLOBECOM), pp. 3170–3175. IEEE (2013)Google Scholar
  12. 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. 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. IEEE (2010)Google Scholar
  14. 14.
    Sang, Y., Shen, H.: Efficient and secure protocols for privacy-preserving set operations. ACM Trans. Inf. Syst. Secur. (TISSEC) 13(1), 9 (2009)CrossRefGoogle Scholar
  15. 15.
    Von Arb, M., Bader, M., Kuhn, M., Wattenhofer, R.: Veneta: serverless friend-of-friend detection in mobile social networking. In: 2008 IEEE International Conference on Wireless Communications, Networking and Mobile Computing, pp. 184–189. IEEE (2008)Google Scholar
  16. 16.
    Wang, Y., Vasilakos, A.V., Jin, Q., Ma, J.: Survey on mobile social networking in proximity (msnp): approaches, challenges and architecture. Wireless Netw. 20(6), 1295–1311 (2014)CrossRefGoogle Scholar
  17. 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. 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
  19. 19.
    Zhang, R., Zhang, J., Zhang, Y., Sun, J., Yan, G.: Privacy-preserving profile matching for proximity-based mobile social networking. IEEE J. Sel. Areas Commun. 31(9), 656–668 (2013)CrossRefGoogle Scholar
  20. 20.
    Zhu, X., Liu, J., Jiang, S., Chen, Z., Li, H.: Efficient weight-based private matching for proximity-based mobile social networks. In: 2014 IEEE International Conference on Communications (ICC), pp. 4114–4119. IEEE (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Information Science and EngineeringCentral South UniversityChangshaChina
  2. 2.School of Information Science and EngineeringHunan UniversityChangshaChina
  3. 3.School of Electronics and Information EngineeringHunan University of Science and EngineeringYongzhouChina
  4. 4.School of Computer Science and Educational SoftwareGuangzhou UniversityGuangzhouChina

Personalised recommendations