Abstract
Currently, none of the existing online social networks (OSNs) enables its users to make new friends without revealing their private information. This leaves the users in a vulnerable position when searching for new friends. We propose a solution which enables a user to compute her profile similarity with another user in a privacy-preserving way. Our solution is designed for a realistic OSN environment, where a pair of users is unlikely to be online at the same time.
Original language | Undefined |
---|---|
Title of host publication | Proceedings of the 18th ACM conference on Computer and communications security (CCS) |
Place of Publication | New York |
Publisher | Association for Computing Machinery (ACM) |
Pages | 793-795 |
Number of pages | 3 |
ISBN (Print) | 978-1-4503-0948-6 |
DOIs | |
Publication status | Published - Oct 2011 |
Event | 18th ACM conference on Computer and Communications Security, CCS 2011 - Chicago, United States Duration: 17 Oct 2011 → 21 Oct 2011 Conference number: 18 |
Publication series
Name | |
---|---|
Publisher | ACM |
Conference
Conference | 18th ACM conference on Computer and Communications Security, CCS 2011 |
---|---|
Abbreviated title | CCS |
Country/Territory | United States |
City | Chicago |
Period | 17/10/11 → 21/10/11 |
Keywords
- METIS-284927
- SCS-Cybersecurity
- EWI-21022
- IR-79573