Privacy-Preserving Profile Matching Using the Social Graph


Jeckmans, Arjan and Tang, Qiang and Hartel, Pieter (2011) Privacy-Preserving Profile Matching Using the Social Graph. In: International Conference on Computational Aspects of Social Networks, CASoN 2011, 19-21 October 2011 , Salamanca, Spain (pp. pp. 42-47).

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:We present a privacy-preserving protocol for users to test a match with potential new friends in an environment where all users cryptographically encrypt their private information. The following scenario is considered. Suppose that user Alice thinks that Bob might be a good new friend. So, Alice and the Online Social Network (representing Bob) engage in a two-party matching protocol. In this protocol no work from Bob is required, Bob can be offline. The matching protocol is designed to give Alice an indication if Bob is similar to her based on their profiles. We show that the process does so without revealing the private information of Alice and Bob to one another and to the Online Social Network.
Item Type:Conference or Workshop Item
Copyright:© 2011 IEEE
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 281654