Are You Really My Friend? Exactly Spatiotemporal Matching Scheme in Privacy-Aware Mobile Social Networks

  • Ben Niu
  • Xiuguang Li
  • Xiaoyan Zhu
  • Xiaoqing Li
  • Hui Li
Conference paper
First Online:
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 153)

Abstract

We propose an exactly spatiotemporal matching scheme for privacy-aware users in MSNs. Based on the carefully designed spatiotemporal profile, our scheme employs a weight-aware pre-matching module to filter out the users with less similarity and some potential adversaries, thus guarantees that no useful information is revealed before determining the best matches. Further, we propose a privacy-preserving exchanging module against Honest-But-Curious users. Finally, the similarity computing module computes the exact matching result to each candidate to determine the best match. Thorough security analysis and evaluation results indicate the effectiveness and efficiency.

Keywords

Mobile social networks Private matching Spatiotemporal 
This is a preview of subscription content, log in to check access.

Notes

Acknowledgement

This work was supported by National NSFC under Grant 61003300, Fundamental Research Funds for the Central Universities under Grant K5051201041, and China 111 Project under Grant B08038. The work of Dr. Hui Li was supported by the National Project 2012ZX03002003-002, 863 Project 2012AA013102, IRT1078 and NSFC 61170251.

References

  1. 1.
    Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of ACM SIGMOD (2003)Google Scholar
  2. 2.
    De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 143–159. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  3. 3.
    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
  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.
    Li, M., Cao, N., Yu, S., Lou, W.: Findu: Privacy-preserving personal profile matching in mobile social networks. In: Proceedings of IEEE INFOCOM (2011)Google Scholar
  6. 6.
    Niu, B., Zhu, X., Liu, J., Li, Z., Li, H.: Weight-aware private matching scheme for proximity-based mobile social networks. In: Proceedings of IEEE GLOBECOM (2013)Google Scholar
  7. 7.
    Niu, B., Zhu, X., Zhang, T., Chi, H., Li, H.: P-match: Priority-aware friend discovery for proximity-based mobile social networks. In: Proceedings of IEEE MASS (2013)Google Scholar
  8. 8.
    Sun, J., Zhang, R., Zhang, Y.: Privacy-preserving spatiotemporal matching. In: Proceedings of IEEE INFOCOM (2013)Google Scholar
  9. 9.
    Wang, Y., ting Zhang, T., zong Li, H., ping He, L., Peng, J.: Efficient privacy preserving matchmaking for mobile social networking against malicious users. In: Proceedings of IEEE TRUSTCOM (2012)Google Scholar
  10. 10.
    Zhang, R., Zhang, Y., Sun, J., Yan, G.: Fine-grained private matching for proximity-based mobile social networking. In: Proceedings of IEEE INFOCOM (2012)Google Scholar

Copyright information

© Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2015

Authors and Affiliations

  • Ben Niu
    • 1
  • Xiuguang Li
    • 1
    • 2
  • Xiaoyan Zhu
    • 1
  • Xiaoqing Li
    • 1
  • Hui Li
    • 1
  1. 1.State Key Laboratory of Integrated Services NetworksXidian UniversityXi’anChina
  2. 2.Key Laboratory of Information and Network SecurityEngineering University of Chinese Armed Police ForceLangfangChina

Personalised recommendations