Nagy, M;
Bui, T;
Cristofaro, ED;
Asokan, N;
Ott, J;
Sadeghi, A-R;
(2015)
How Far Removed Are You? Scalable Privacy-Preserving Estimation of Social Path Length with Social PaL.
In:
Proceedings of the 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks Article No. 18.
ACM: New York, USA.
Preview |
Text
De Cristofaro_1412.2433.pdf - Accepted Version Download (3MB) | Preview |
Abstract
Social relationships are a natural basis on which humans make trust decisions. Online Social Networks (OSNs) are increasingly often used to let users base trust decisions on the existence and the strength of social relationships. While most OSNs allow users to discover the length of the social path to other users, they do so in a centralized way, thus requiring them to rely on the service provider and reveal their interest in each other. This paper presents Social PaL, a system supporting the privacy-preserving discovery of arbitrary-length social paths between any two social network users. We overcome the bootstrapping problem encountered in all related prior work, demonstrating that Social PaL allows its users to find all paths of length two and to discover a significant fraction of longer paths, even when only a small fraction of OSN users is in the Social PaL system - e.g., discovering 70% of all paths with only 40% of the users. We implement Social PaL using a scalable server-side architecture and a modular Android client library, allowing developers to seamlessly integrate it into their apps.
Type: | Proceedings paper |
---|---|
Title: | How Far Removed Are You? Scalable Privacy-Preserving Estimation of Social Path Length with Social PaL |
Event: | 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks Article No. 18 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1145/2766498.2766501 |
Publisher version: | http://doi.org/10.1145/2766498.2766501 |
Language: | English |
Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/1508473 |




Archive Staff Only
![]() |
View Item |