Abstract
A social matching service has recently become popular. These services help a user to search friends having common preference or interest. On the other hand, users use their personal information for matching in social matching services, and thus the privacy-preserving profile matching protocols have been well studied. However, although there are various privacy-preserving profile matching protocols, they may cause unwilling matching. In order to solve this problem, it is necessary to achieve a fine-grained matching mechanism considering conditions.
In this paper, we propose a privacy-preserving profile matching protocol embedded with homomorphic encryption considering conditions: matching is established only when the conditions are satisfied. Our protocol reduces computational cost of user’s device by using the map-to-prime technique and setting an honest-but-curious server. Furthermore, even if a server is attacked, user’s secret key or personal data does not leak since our protocol is designed for a server without such confidential data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abbas, F., Rajput, U., Hussain, R., Eun, H., Oh, H.: A trustless broker based protocol to discover friends in proximity-based mobile social networks. In: Rhee, K.-H., Yi, J.H. (eds.) WISA 2014. LNCS, vol. 8909, pp. 216–227. Springer, Heidelberg (2015). doi:10.1007/978-3-319-15087-1_17
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). doi:10.1007/978-3-540-24676-3_1
He, D., Cao, Z., Dong, X., Shen, J.: User self-controllable profile matching for privacy-preserving mobile social networks. IEEE ICCS 2014, 248–252 (2014)
Kim, M., Lee, H.T., Cheon, J.H.: Mutual private set intersection with linear complexity. In: Jung, S., Yung, M. (eds.) WISA 2011. LNCS, vol. 7115, pp. 219–231. Springer, Heidelberg (2012). doi:10.1007/978-3-642-27890-7_18
Li, M., Yu, S., Cao, N., Lou, W.: Privacy-preserving distributed profile matching in proximity-based mobile social networks. IEEE Trans. Wirel. Commun. 12(5), 2024–2033 (2013)
Sarpong, S., Xu, C., Zhang, X.: An authenticated privacy-preserving attribute matchmaking protocol for mobile social networks. Int. J. Netw. Secur. 17(3), 357–364 (2015)
Sarpong, S., Xu, C., Zhang, X.: PPAM: privacy-preserving attributes matchmaking protocol for mobile social networks secure against malicious users. Int. J. Netw. Secur. 18(4), 625–632 (2016)
Thapam, A., Li, M., Salinas, S., Li, P.: Asymmetric social proximity based private matching protocols for online social networks. IEEE Trans. Parallel Distrib. Syst. 26(6), 1547–1559 (2014)
Zhang, R., Zhang, Y., Sun, J.S., Yan, G.: Fine-grained private matching for proximity-based mobile social networking. IEEE INFOCOM 2012, 1–9 (2012)
Zhu, H., Du, S., Li, M., Gao, Z.: Fairness-aware and privacy-preserving friend matching protocol in mobile social networks. IEEE Trans. Emerg. Top. Comput. 1(1), 192–200 (2013)
Acknowledgements
This work was partly supported by Grant-in-Aid for Scientific Research (C) (16K00183).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Ishikuro, Y., Omote, K. (2016). Privacy-Preserving Profile Matching Protocol Considering Conditions. In: Chen, J., Piuri, V., Su, C., Yung, M. (eds) Network and System Security. NSS 2016. Lecture Notes in Computer Science(), vol 9955. Springer, Cham. https://doi.org/10.1007/978-3-319-46298-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-46298-1_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46297-4
Online ISBN: 978-3-319-46298-1
eBook Packages: Computer ScienceComputer Science (R0)