Privacy-Preserving and Efficient Friend Recommendation in Online Social Networks
Bharath K. Samanthula(a),(*), Lei Cen(a), Wei Jiang(b), Luo Si(a)
Transactions on Data Privacy 8:2 (2015) 141 - 171
(a) Department of Computer Science, Purdue University, 305 N University St,West Lafayette, IN 47907-2066, USA.
(b) Department of Computer Science,Missouri University of Science and Technology, 310 Computer Science Building, 500 W15th St, Rolla, MO 65409-0350, USA.
e-mail:bsamanth @purdue.edu; lcen @cs.purdue.edu; wjiang @mst.edu; lsi @cs.purdue.edu
The popularity of online social networks (OSNs) is on constant rise due to various advantages, including online communication and sharing information of interest among friends. It is often that users want to make new friends to expand their social connections as well as to obtain information from a broad range of people. Friend recommendation is a very important application in many OSNs and has been studied extensively in the recent past. However,with the growing concerns about user privacy, there is a strong need to develop privacy-preserving friend recommendation methods for social networks. In this paper, we propose two novel methods to recommend friends for a given user by using the common neighbors proximity measure in a privacy-preserving manner. The first method is based on the properties of an additive homomorphic encryption scheme and also utilizes a universal hash function for efficiency purpose. The second method utilizes the concept of protecting the source privacy through anonymousmessage routing and recommends friends accurately and efficiently. In addition, we empirically compare the efficiency and accuracy of the proposed protocols, and address the implementation details of the two methods in practice. The proposed protocols provide a trade-off among security, accuracy, and efficiency; thus, users or the network provider can choose between these two protocols depending on the underlying requirements.