Interest-driven private friend recommendation

The emerging growth of online social networks has opened new doors for various kinds of applications such as business intelligence and expanding social connections through friend recommendations. In particular, friend recommendation facilitates users to explore new friendships based on social network structures, user profile information (similar interest) or both. However, as the privacy concerns of users are on the rise, searching for new friends is not a straightforward task under the assumption that users' information is kept private. Along this direction, this paper proposes two private friend recommendation algorithms based on the social network structure and the users' social tags. The first protocol is more efficient from a user's perspective compared to the second protocol, and this efficiency gain comes at the expense of relaxing the underlying privacy assumptions. On the other hand, the second protocol provides the best security guarantee. In addition, we empirically analyze the complexities of the proposed protocols and provide various experimental results.