20 20

Transactions on
Data Privacy
Foundations and Technologies

http://www.tdp.cat


Articles in Press

Accepted articles here

Latest Issues

Year 2017

Volume 10 Issue 2
Volume 10 Issue 1

Year 2016

Volume 9 Issue 3
Volume 9 Issue 2
Volume 9 Issue 1

Year 2015

Volume 8 Issue 3
Volume 8 Issue 2
Volume 8 Issue 1

Year 2014

Volume 7 Issue 3
Volume 7 Issue 2
Volume 7 Issue 1

Year 2013

Volume 6 Issue 3
Volume 6 Issue 2
Volume 6 Issue 1

Year 2012

Volume 5 Issue 3
Volume 5 Issue 2
Volume 5 Issue 1

Year 2011

Volume 4 Issue 3
Volume 4 Issue 2
Volume 4 Issue 1

Year 2010

Volume 3 Issue 3
Volume 3 Issue 2
Volume 3 Issue 1

Year 2009

Volume 2 Issue 3
Volume 2 Issue 2
Volume 2 Issue 1

Year 2008

Volume 1 Issue 3
Volume 1 Issue 2
Volume 1 Issue 1


Volume 8 Issue 2


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

Abstract, PDF

(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


Abstract

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.

* Corresponding author.

Follow us




Supports










ISSN: 1888-5063; ISSN (Digital): 2013-1631; D.L.:B-11873-2008; Web Site: http://www.tdp.cat/
Contact: Transactions on Data Privacy; Vicenç Torra; U. of Skövde; PO Box 408; 54128 Skövde; (Sweden); e-mail:tdp@tdp.cat

 


Vicenç Torra, Last modified: 10 : 27 June 27 2015.