Secure and efficient friend recommendation in online social network

Read full text Summarise with VIRAT
Authors: Lulu Han, Zhuolan Liu, Yanling Li, Zhiquan Liu, Yudan Cheng, Jiaquan Shen, Fang Xu Han
Cited by: 0
References: 33

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Nowadays, more and more people are expanding their network through online social network services, such as friend recommendation. To improve user experience, the social network service provider wishes to outsource its services to a powerful cloud. Since the cloud is always untrusted, uploading query data and users’ information to it may cause serious privacy issues. Although some schemes have been proposed to address these privacy concerns, there are still some problems in privacy and efficiency. To deal with these problems, we propose a privacy-preserving friend recommendation scheme that is more secure and efficient than the state-of-the-art work. Specifically, based on three-party secret sharing ( TPSS ) scheme, we propose a secure threshold testing ( STT ) protocol to check whether an encrypted value is greater than the given threshold value. Second, we design a more secure and efficient friend recommendation scheme with the help of our proposed STT and the homomorphic properties of TPSS . Finally, the security of our scheme is proved in the semi-honest model, and the privacy of users is well preserved. Also, we evaluate the performance of the proposed scheme through extensive experiments. The results demonstrate that our proposed scheme outperforms the state-of-the-art.

Fields of Study & Subjects

Cryptography and Data Security Cloud Data Security Solutions Privacy-Preserving Technologies in Data

Publication details

Journal / source
Peer-to-Peer Networking and Applications
Volume
19
Issue
3
Pages
76
Publication date
1 April 2026
Language
EN