A privacy-preserving fuzzy interest matching protocol for friends finding in social networks
Rights accessOpen Access
Nowadays, it is very popular to make friends, share photographs, and exchange news throughout social networks. Social networks widely expand the area of people’s social connections and make communication much smoother than ever before. In a social network, there are many social groups established based on common interests among persons, such as learning group, family group, and reading group. People often describe their profiles when registering as a user in a social network. Then social networks can organize these users into groups of friends according to their profiles. However, an important issue must be considered, namely many users’ sensitive profiles could have been leaked out during this process. Therefore, it is reasonable to design a privacy-preserving friends-finding protocol in social network. Toward this goal, we design a fuzzy interest matching protocol based on private set intersection. Concretely, two candidate users can first organize their profiles into sets, then use Bloom filters to generate new data structures, and finally find the intersection sets to decide whether being friends or not in the social network. The protocol is shown to be secure in the malicious model and can be useful for practical purposes.
CitationWang, X., Xhafa, F., Luo, X., Zhang, S., Ding, Y. A privacy-preserving fuzzy interest matching protocol for friends finding in social networks. "Soft computing", 7 Febrer 2017, vol 22, num. 1, p.2517-2526.