Robust overlays for privacy-preserving data dissemination over a social graph

Abhishek Singh*, Guido Urdaneta, Maarten van Steen, Roman Vitenberg

*Corresponding author for this work

Research output: Contribution to conferencePaperAcademicpeer-review

8 Citations (Scopus)

Abstract

A number of recently proposed systems provide secure and privacy-preserving data dissemination by leveraging pre-existing social trust relations and effectively mapping them into communication links. However, as we show in this paper, the underlying trust graph may not be optimal as a communication overlay. It has relatively long path lengths and it can be easily partitioned in scenarios where users are unavailable for a fraction of time. Following this observation, we present a method for improving the robustness of trust-based overlays. Essentially, we start with an overlay derived from the trust graph and evolve it in a privacy-preserving fashion into one that lends itself to data dissemination. The experimental evaluation shows that our approach leads to overlays that are significantly more robust under churn, and exhibit lower path lengths than the underlying trust graph

Original languageEnglish
Pages234-244
Number of pages11
DOIs
Publication statusPublished - 5 Oct 2012
Externally publishedYes
Event32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012 - Macau, China
Duration: 18 Jun 201221 Jun 2012
Conference number: 32

Conference

Conference32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012
Abbreviated titleICDCS 2012
CountryChina
CityMacau
Period18/06/1221/06/12

Keywords

  • Online social networks
  • Peer-to-peer
  • Privacy

Fingerprint Dive into the research topics of 'Robust overlays for privacy-preserving data dissemination over a social graph'. Together they form a unique fingerprint.

Cite this