Privacy-Preserving User Profile Matching in Social Networks
摘要
In this chapter, we address a scenario in which a user queries a user profile database, maintained by a social networking service provider, to identify users whose profiles are similar to the one specified by the querying user. A common example of this application is online dating. Recently, the online dating site Ashley Madison was hacked, leading to the exposure of a large number of dating user profiles. This data breach has prompted researchers to investigate practical privacy protection methods for user profiles in social networks. In this chapter, we introduce a privacy-preserving solution for profile matching in social networks using multiple servers. Our solution is based on homomorphic encryption and enables a user to find matching profiles with the assistance of multiple servers, without revealing the query or the queried user profiles in plaintext. The proposed solution ensures both user profile privacy and query privacy, as long as at least one of the multiple servers is honest.