User-friendly matching protocol for online social networks


Tang, Qiang (2010) User-friendly matching protocol for online social networks. In: 17th ACM Conference on Computer and Communications Security, 4-8 oct 2010, Chicago, IL (pp. pp. 732-734).

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:In this paper, we outline a privacy-preserving matching protocol for OSN (online social network) users to find their potential friends. With the proposed protocol, a logged-in user can match her profile with that of an off-line stranger, while both profiles are maximally protected. Our solution successfully eliminates the requirement of "out-of-band" communication channels, which is one of the biggest obstacles facing cryptographic solutions for OSNs.
Item Type:Conference or Workshop Item
Copyright:© 2010 ACM
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