Privacy-preserving and efficient friend recommendation in online social networks

Bharath Kumar Samanthula, Lei Cen, Wei Jiang, Luo Si

Research output: Contribution to journalArticleResearchpeer-review

9 Citations (Scopus)

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 anonymous message 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.

Original languageEnglish
Pages (from-to)141-171
Number of pages31
JournalTransactions on Data Privacy
Volume8
Issue number2
StatePublished - 29 Jun 2015

Fingerprint

Privacy Preserving
Social Networks
Recommendations
Hash functions
Privacy
Cryptography
Homomorphic Encryption
Universal Function
Information Sharing
Hash Function
Communication
Proximity
Expand
Routing
Choose
Trade-offs
Requirements
Range of data

Keywords

  • Encryption
  • Friend recommendation
  • Online social network
  • Privacy

Cite this

@article{d9fd40f5d70441f69e2ec28938c4e128,
title = "Privacy-preserving and efficient friend recommendation in online social networks",
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 anonymous message 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.",
keywords = "Encryption, Friend recommendation, Online social network, Privacy",
author = "Samanthula, {Bharath Kumar} and Lei Cen and Wei Jiang and Luo Si",
year = "2015",
month = "6",
day = "29",
language = "English",
volume = "8",
pages = "141--171",
journal = "Transactions on Data Privacy",
issn = "1888-5063",
publisher = "University of Skovde",
number = "2",

}

Privacy-preserving and efficient friend recommendation in online social networks. / Samanthula, Bharath Kumar; Cen, Lei; Jiang, Wei; Si, Luo.

In: Transactions on Data Privacy, Vol. 8, No. 2, 29.06.2015, p. 141-171.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Privacy-preserving and efficient friend recommendation in online social networks

AU - Samanthula, Bharath Kumar

AU - Cen, Lei

AU - Jiang, Wei

AU - Si, Luo

PY - 2015/6/29

Y1 - 2015/6/29

N2 - 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 anonymous message 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.

AB - 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 anonymous message 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.

KW - Encryption

KW - Friend recommendation

KW - Online social network

KW - Privacy

UR - http://www.scopus.com/inward/record.url?scp=84933523414&partnerID=8YFLogxK

M3 - Article

VL - 8

SP - 141

EP - 171

JO - Transactions on Data Privacy

JF - Transactions on Data Privacy

SN - 1888-5063

IS - 2

ER -