Conference Proceeding

Edge Anonymity in Social Network Graphs

Dept. of Comput. Sci., Univ. of Texas at San Antonio, San Antonio, TX, USA
10/2009; DOI:10.1109/CSE.2009.310 In proceeding of: Computational Science and Engineering, 2009. CSE '09. International Conference on, Volume: 4
Source: IEEE Xplore

ABSTRACT Edges in social network graphs may represent sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge anonymity, called graph confidence, which is general enough to capture the privacy breach made by an adversary who can pinpoint target persons in a graph partition based on any given set of topological features of vertexes. We consider a special type of edge anonymity problem which uses vertex degree to partition a graph. We analyze edge disclosure in real-world social networks and show that although some graphs can preserve vertex anonymity, they may still not preserve edge anonymity. We present three heuristic algorithms that protect edge anonymity using edge swap or edge deletion. Our experimental results, based on three real-world social networks and several utility measures, show that these algorithms can effectively preserve edge anonymity yet obtain anonymous graphs of acceptable utility.

0 0
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Nowadays, partly driven by many Web 2.0 applications, more and more social network data has been made publicly available and analyzed in one way or another. Privacy pre- serving publishing of social network data becomes a more and more important concern. In this paper, we present a brief yet systematic review of the existing anonymization techniques for privacy preserving publishing of social net- work data. We identify the new challenges in privacy pre- serving publishing of social network data comparing to the extensively studied relational case, and examine the pos- sible problem formulation in three important dimensions: privacy, background knowledge, and data utility. We sur- vey the existing anonymization methods for privacy preser- vation in two categories: clustering-based approaches and graph modiflcation approaches.
    SIGKDD Explorations. 01/2008; 10:12-22.
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: In a social network, nodes correspond to people or other social en- tities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anonymization replaces names with meaningless unique identifiers. We describe a family of attacks such that even from a single anonymized copy of a social network, it is possible for an adversary to learn whether edges exist or not between specific targeted pairs of nodes.
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Recently, as more and more social network data has been published in one way or another, preserving privacy in publishing social network data becomes an important concern. With some local knowledge about individuals in a social network, an adversary may attack the privacy of some victims easily. Unfortunately, most of the previous studies on privacy preservation can deal with relational data only, and cannot be applied to social network data. In this paper, we take an initiative towards preserving privacy in social network data. We identify an essential type of privacy attacks: neighborhood attacks. If an adversary has some knowledge about the neighbors of a target victim and the relationship among the neighbors, the victim may be re-identified from a social network even if the victim's identity is preserved using the conventional anonymization techniques. We show that the problem is challenging, and present a practical solution to battle neighborhood attacks. The empirical study indicates that anonymized social networks generated by our method can still be used to answer aggregate network queries with high accuracy.
    Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on; 05/2008


Available from