On Link Privacy in Randomizing Social Networks

Free registration required

Executive Summary

Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple technique of anonymizing graphs by replacing the identifying information of the nodes with random ids does not guarantee privacy since the identification of the nodes can be seriously jeopardized by applying subgraph queries. In this paper, the authors investigate how well an edge based graph randomization approach can protect sensitive links.

  • Format: PDF
  • Size: 216.1 KB