Abstract
Most recommendation systems in social networks provide users with relevant new friend suggestions by processing their personal information or their current friends lists. However, providing such recommendations may leak users’ private information. We present a new differentially private recommendation algorithm that preserves the privacy of both attribute values and friend links. The algorithm mainly proceeds by adding calibrated noise to an adequate matrix representation of the social network. To get a good trade-off between privacy and accuracy, the required amount of noise should be limited and therefore we need to mitigate the prohibitive sensitivity of the matrix representation. For that, we apply a graph projection technique to control the size of friends lists. The effectiveness of our approach is demonstrated by experiments on real-world datasets and comparisons with existing methods.
Funded by LUE DigiTrust (http://lue.univ-lorraine.fr/fr/article/digitrust/).
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
Similar content being viewed by others
References
Arcolezi, H.H.: Jean-François Couchot, Sébastien Gambs, Catuscia Palamidessi, Majid Zolfaghari: Multi-Freq-LDPy: Multiple Frequency Estimation Under Local Differential Privacy in Python. ESORICS 3(2022), 770–775 (2022)
Cheng, H., Qian, M., Li, Q., Zhou, Y., Chen, T.: An efficient privacy-preserving friend recommendation scheme for social network. IEEE Access 6, 56018–56028 (2018)
McSherry, F., Mironov, I.: Differentially private recommender systems: building privacy into the Netflix prize contenders. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 627–636 (2009)
Barathy, R., Chitra, P.: Applying matrix factorization in collaborative filtering recommender systems. In: 2020 6th International Conference on Advanced Computing and Communication Systems (ICACCS), pp. 635–639 (2020)
Dwork, C., Roth, A.: others, the algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9, 211–407 (2014)
Berlioz, A., Friedman, A., Kaafar, M., Boreli, R., Berkovsky, S.: Applying differential privacy to matrix factorization. In: Proceedings of the 9th ACM Conference on Recommender Systems, pp. 107–114 (2015)
Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N.: Privacy-preserving matrix factorization, pp. 801–812. CCS, Dan Boneh (2013)
Zhang, S., Li, X., Liu, H., Lin, Y., Sangaiah, A.K.: A privacy-preserving friend recommendation scheme in online social networks. Sustain. Cities Soc. 38, 275–285 (2018)
Guo, T., Luo, J., Dong, K., Yang, M.: Differentially private graph-link analysis based social recommendation. Inf. Sci. 463–464, 214–226 (2018)
Liu, Z., Wang, Y., Smola, A.: Fast differentially private matrix factorization. In: Proceedings of the 9th ACM Conference on Recommender Systems, pp. 171–178 (2015)
Zhang, S., Yin, H., Chen, T., Huang, Z., Lizhen, C., Zhang, X.: Graph embedding for recommendation against attribute inference attacks. In: WWW, pp. 3002–3014 (2021)
Day, W., Li, N., Lyu, M.: Publishing graph degree distribution with node differential privacy. In: Proceedings of the 2016 International Conference on Management of Data, pp. 123–138 (2016)
Blocki, J., Blum, A., Datta, A., Sheffet, O.: Differentially private data analysis of social networks via restricted sensitivity. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pp. 87–96 (2013)
Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265–284. Springer, Heidelberg (2006). https://doi.org/10.1007/11681878_14
Brendel, W., Han, F., Marujo, L., Jie, L., Korolova, A.: Practical privacy-preserving friend recommendations on social networks. In: Companion Proceedings of the Web Conference 2018, pp. 111–112 (2018)
Smith, S., Park, J., Karypis, G.: An exploration of optimization algorithms for high performance tensor completion. In: SC2016: Proceedings of the International Conference for High Performance Computing, Networking, Storage And Analysis, pp. 359–371 (2016)
Jorgensen, Z., Yu, T., Cormode, G.: Publishing attributed social graphs with formal privacy guarantees. In: Proceedings of the 2016 International Conference on Management of Data, pp. 107–122 (2016)
Leskovec, J., Mcauley, J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems, vol. 25 (2012)
Machanavajjhala, A., Korolova, A., Sarma, A.: Personalized social recommendations-accurate or private? ArXiv Preprint: ArXiv:1105.4254 (2011)
Samanthula, B., Cen, L., Jiang, W., Si, L.: Privacy-preserving and efficient friend recommendation in online social networks. Trans. Data Priv. 8, 141–171 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Macwan, K., Imine, A., Rusinowitch, M. (2023). Differentially Private Friends Recommendation. In: Jourdan, GV., Mounier, L., Adams, C., Sèdes, F., Garcia-Alfaro, J. (eds) Foundations and Practice of Security. FPS 2022. Lecture Notes in Computer Science, vol 13877. Springer, Cham. https://doi.org/10.1007/978-3-031-30122-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-30122-3_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-30121-6
Online ISBN: 978-3-031-30122-3
eBook Packages: Computer ScienceComputer Science (R0)