Skip to main content
SpringerLink
Log in

Efficient Private Matching Scheme for Friend Information Exchange

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9530))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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)

    Chapter  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 

  6. Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005)

    Chapter  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 

  8. Liu, Q., Wang, G., Wu, J.: Time-based proxy re-encryption scheme for secure data sharing in a cloud environment. Inf. Sci. 258, 355–370 (2014)

    Article  Google Scholar 

  9. Lu, R., Lin, X., Liang, X., Shen, X.: A secure handshake scheme with symptoms matching for mHealthcare social network. Mob. Netw. Appl. 16(6), 683–694 (2011)

    Article  Google Scholar 

  10. 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)

    Article  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 

  14. Sang, Y., Shen, H.: Efficient and secure protocols for privacy-preserving set operations. ACM Trans. Inf. Syst. Secur. (TISSEC) 13(1), 9 (2009)

    Article  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 

  16. Wang, G., Musau, F., Guo, S., Abdullahi, M.B.: Neighbor similarity trust against sybil attack in P2P e-commerce. IEEE Trans. Parallel Distrib. Syst. 26(3), 824–833 (2015)

    Article  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 

  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)

    Article  Google Scholar 

Download references

Acknowledgements

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.

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, 410083, China

    Fang Qi & Wenbo Wang

Authors
  1. Fang Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenbo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wenbo Wang .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Guojun Wang

  2. The University of Sydney, Sydney, New South Wales, Australia

    Albert Zomaya

  3. University of Murcia, Murcia, Murcia, Spain

    Gregorio Martinez

  4. Hunan University, Changsha, China

    Kenli Li

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Qi, F., Wang, W. (2015). Efficient Private Matching Scheme for Friend Information Exchange. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9530. Springer, Cham. https://doi.org/10.1007/978-3-319-27137-8_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27137-8_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27136-1

  • Online ISBN: 978-3-319-27137-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation