{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T11:43:39Z","timestamp":1775043819913,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"DOI":"10.1007\/s12083-026-02232-8","type":"journal-article","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:10:39Z","timestamp":1775038239000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure and efficient friend recommendation in online social network"],"prefix":"10.1007","volume":"19","author":[{"given":"Lulu","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuolan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanling","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiquan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yudan","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaquan","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"key":"2232_CR1","doi-asserted-by":"crossref","unstructured":"Asharov G, Hamada K, Ikarashi D, Kikuchi R, Nof A, Pinkas B, Takahashi K, Tomida J (2022) Efficient secure three-party sorting with applications to data analysis and heavy hitters. ACM, pp 125\u2013138","DOI":"10.1145\/3548606.3560691"},{"key":"2232_CR2","doi-asserted-by":"crossref","unstructured":"Cai J, Liu Y, Liu X, Li J, Zhuang H (2022) Privacy-preserving federated cross-domain social recommendation. In: International workshop on trustworthy federated learning. Springer, pp 144\u2013158","DOI":"10.1007\/978-3-031-28996-5_11"},{"key":"2232_CR3","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd Edition. MIT Press"},{"key":"2232_CR4","doi-asserted-by":"crossref","unstructured":"Dhelim S, Aung N, Amine Bouras M, Ning H, Cambria E (2022) A survey on personality-aware recommendation systems. Artif Intell Rev 1\u201346","DOI":"10.1007\/s10462-021-10063-7"},{"issue":"6","key":"2232_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory 22(6):644\u2013654","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"2232_CR6","doi-asserted-by":"publisher","first-page":"5658","DOI":"10.1109\/TCSS.2024.3378349","volume":"11","author":"L Gao","year":"2024","unstructured":"Gao L, Jiguo Yu, Zhao J, Chunqiang H (2024) A novel temporal privacy-preserving model for social recommendation. IEEE Trans Comput Soc Syst 11(5):5658\u20135670","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2232_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich O (2004) The foundations of cryptography - Volume 2: basic applications. Cambridge University Press","DOI":"10.1017\/CBO9780511721656"},{"key":"2232_CR8","doi-asserted-by":"crossref","unstructured":"Halimi A, Ayday E (2020) Profile matching across online social networks. In: Information and communications security: 22nd international conference, ICICS 2020, Copenhagen, Denmark, August 24\u201326, 2020, Proceedings 22, pp 54\u201370","DOI":"10.1007\/978-3-030-61078-4_4"},{"key":"2232_CR9","doi-asserted-by":"crossref","unstructured":"Han L, Luo W, Lu R, Zheng Y, Yang A, Lai J, Cheng Y, Zhang Y (2024) Privacy-preserving travel recommendation based on stay points over outsourced spatio-temporal data. IEEE Trans Intell Trans Syst","DOI":"10.1109\/TITS.2024.3432029"},{"key":"2232_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2025.111243","volume":"264","author":"L Han","year":"2025","unstructured":"Han L, Luo W, Yang A, Cheng Y, Lai J, Han F, Shen J, Zhang Y (2025) Privacy-preserving cross-domain point-of-interests recommendation based on friendship in lbss. Comput Netw 264:111243","journal-title":"Comput Netw"},{"key":"2232_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.ins.2020.07.046","volume":"543","author":"Y Huo","year":"2021","unstructured":"Huo Y, Chen B, Tang J, Zeng Y (2021) Privacy-preserving point-of-interest recommendation based on geographical and social influence. Inf Sci 543:202\u2013218","journal-title":"Inf Sci"},{"key":"#cr-split#-2232_CR12.1","doi-asserted-by":"crossref","unstructured":"Joux A (2000) A one round protocol for tripartite diffie-hellman. In: Bosma W","DOI":"10.1007\/10722028_23"},{"key":"#cr-split#-2232_CR12.2","unstructured":"(ed) Algorithmic number theory, 4th international symposium, ANTS-IV, Leiden, The Netherlands, July 2-7, 2000, Proceedings, volume 1838 of Lecture Notes in Computer Science. Springer, pp 385-394"},{"key":"2232_CR13","doi-asserted-by":"crossref","unstructured":"Kulal N, Dhamdhere V (2017) Technique for preserving privacy on friend recommendation system by using naive bayes classifier in osn. In: 2017 International conference on intelligent computing and control systems (ICICCS). IEEE, pp 315\u2013319","DOI":"10.1109\/ICCONS.2017.8250734"},{"issue":"4","key":"2232_CR14","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.1007\/s12083-021-01140-3","volume":"14","author":"C Lai","year":"2021","unstructured":"Lai C, Yangyang D, Guo Q, Zheng D (2021) A trust-based privacy-preserving friend matching scheme in social internet of vehicles. Peer-to-Peer Netw Appl 14(4):2011\u20132025","journal-title":"Peer-to-Peer Netw Appl"},{"key":"2232_CR15","doi-asserted-by":"crossref","unstructured":"Li C, Zhu X, Liu Y, Lu Z, Liu Y, Huang H (2025) Friend discovery scheme with privacy protection in mobile social networks. In: International conference on wireless artificial intelligent computing systems and applications. Springer, pp 75\u201385","DOI":"10.1007\/978-981-96-8725-1_7"},{"issue":"2","key":"2232_CR16","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/JIOT.2016.2582780","volume":"4","author":"M Li","year":"2016","unstructured":"Li M, Ruan N, Qian QY, Zhu H, Liang X, Le Yu (2016) Spfm: Scalable and privacy-preserving friend matching in mobile cloud. IEEE Internet Things J 4(2):583\u2013591","journal-title":"IEEE Internet Things J"},{"key":"2232_CR17","doi-asserted-by":"crossref","unstructured":"Liu F, Wu G, Liu Y (2020) A privacy-preserving friend recommendation mechanism for online social networks. In: Proceedings of the 2020 4th international conference on cryptography, security and privacy, pp 63\u201367","DOI":"10.1145\/3377644.3377648"},{"issue":"8","key":"2232_CR18","doi-asserted-by":"publisher","first-page":"082102","DOI":"10.1007\/s11432-015-9029-y","volume":"60","author":"Z Liu","year":"2017","unstructured":"Liu Z, Ma J, Jiang Z, Miao Y (2017) Fct: a fully-distributed context-aware trust model for location based service recommendation. Sci China Inf Sci 60(8):082102","journal-title":"Sci China Inf Sci"},{"key":"2232_CR19","doi-asserted-by":"crossref","unstructured":"Meng X, Wang S, Shu K, Li J, Chen B, Liu H, Zhang Y (2018) Personalized privacy-preserving social recommendation. In: Proceedings of the AAAI conference on artificial intelligence, vol 32","DOI":"10.1609\/aaai.v32i1.11714"},{"issue":"6","key":"2232_CR20","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1007\/s10207-023-00710-1","volume":"22","author":"TB Ogunseyi","year":"2023","unstructured":"Ogunseyi TB, Avoussoukpo CB, Jiang Y (2023) A systematic review of privacy techniques in recommendation systems. Int J Inf Secur 22(6):1651\u20131664","journal-title":"Int J Inf Secur"},{"key":"2232_CR21","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International conference on the theory and applications of cryptographic techniques, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"2","key":"2232_CR22","first-page":"141","volume":"8","author":"BK Samanthula","year":"2015","unstructured":"Samanthula BK, Cen L, Jiang W, Si L (2015) Privacy-preserving and efficient friend recommendation in online social networks. Trans Data Priv 8(2):141\u2013171","journal-title":"Trans Data Priv"},{"key":"2232_CR23","doi-asserted-by":"crossref","unstructured":"Song Y, Xu C, Zhang Y, Cheng N (2021) Privacy-preserving friend matching for mobile social networks. In: 2021 IEEE global communications conference (GLOBECOM). IEEE, pp 01\u201306","DOI":"10.1109\/GLOBECOM46510.2021.9685386"},{"issue":"5","key":"2232_CR24","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TDSC.2016.2631533","volume":"15","author":"Q Tang","year":"2016","unstructured":"Tang Q, Wang J (2016) Privacy-preserving friendship-based recommender systems. IEEE Trans Dependable Secure Comput 15(5):784\u2013796","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2232_CR25","doi-asserted-by":"crossref","unstructured":"Uplavikar NM, Vaidya J, Lin D, Jiang W (2020) Privacy-preserving friend recommendation in an integrated social environment. In: Information systems security: 16th international conference, ICISS 2020, Jammu, India, December 16\u201320, 2020, Proceedings 16. Springer, pp 117\u2013136","DOI":"10.1007\/978-3-030-65610-2_8"},{"key":"2232_CR26","doi-asserted-by":"crossref","unstructured":"Wainakh A, Grube T, Daubert J, M\u00fchlh\u00e4user M (2019) Efficient privacy-preserving recommendations based on social graphs. In: Proceedings of the 13th ACM conference on recommender systems, pp 78\u201386","DOI":"10.1145\/3298689.3347013"},{"key":"2232_CR27","doi-asserted-by":"crossref","unstructured":"Yi X, Bertino E, Rao F-Y, Bouguettaya A (2016) Practical privacy-preserving user profile matching in social networks. In: 2016 IEEE 32nd international conference on data engineering (ICDE). IEEE, pp 373\u2013384","DOI":"10.1109\/ICDE.2016.7498255"},{"issue":"8","key":"2232_CR28","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1109\/TKDE.2019.2912748","volume":"32","author":"X Yi","year":"2019","unstructured":"Yi X, Bertino E, Rao F-Y, Lam K-Y, Nepal S, Bouguettaya A (2019) Privacy-preserving user profile matching in social networks. IEEE Trans Knowl Data Eng 32(8):1572\u20131585","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"2232_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3548455","volume":"41","author":"T Zang","year":"2022","unstructured":"Zang T, Zhu Y, Liu H, Zhang R, Jiadi Yu (2022) A survey on cross-domain recommendation: taxonomies, methods, and future directions. ACM Trans Inf Syst 41(2):1\u201339","journal-title":"ACM Trans Inf Syst"},{"key":"2232_CR30","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.scs.2017.12.031","volume":"38","author":"S Zhang","year":"2018","unstructured":"Zhang S, Li X, Liu H, Lin Y, Sangaiah AK (2018) A privacy-preserving friend recommendation scheme in online social networks. Sustain Cities Soc 38:275\u2013285","journal-title":"Sustain Cities Soc"},{"key":"2232_CR31","doi-asserted-by":"crossref","unstructured":"Zheng Y, Lu R, Zhang S, Shao J, Zhu H (2024) Achieving practical and privacy-preserving knn query over encrypted data. IEEE Trans Dependable Secure Comput","DOI":"10.1109\/TDSC.2024.3376084"},{"key":"2232_CR32","doi-asserted-by":"crossref","unstructured":"Zheng Y, Zhu H, Lu R, Zhang S, Wang F, Shao J, Li H (2024) Efficient and privacy-preserving weighted range set sampling in cloud. IEEE Trans Dependable Secure Comput","DOI":"10.1109\/TDSC.2024.3408816"},{"key":"2232_CR33","doi-asserted-by":"crossref","unstructured":"Zhou W, Liu Z, Haq AU, Li Y, Jiang ZL (2025) Differentially private matrix factorization with sub-linear convergence rate for personalized recommendation. Inf Fusion 103621,","DOI":"10.1016\/j.inffus.2025.103621"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-026-02232-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-026-02232-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-026-02232-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:10:49Z","timestamp":1775038249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-026-02232-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,1]]},"references-count":34,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,5]]}},"alternative-id":["2232"],"URL":"https:\/\/doi.org\/10.1007\/s12083-026-02232-8","relation":{},"ISSN":["1936-6450"],"issn-type":[{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,1]]},"assertion":[{"value":"22 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"76"}}