Conference Paper

Edge Anonymity in Social Network Graphs

Dept. of Comput. Sci., Univ. of Texas at San Antonio, San Antonio, TX, USA
DOI: 10.1109/CSE.2009.310 Conference: 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.

  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses the problem of privacy-preserving data publishing for social network. Research on protecting the privacy of individuals and the confidentiality of data in social network has recently been receiving increasing attention. Privacy is an important issue when one wants to make use of data that involves individuals' sensitive information, especially in a time when data collection is becoming easier and sophisticated data mining techniques are becoming more efficient. In this paper, we discuss various privacy attack vectors on social networks. We present algorithms that sanitize data to make it safe for release while preserving useful information, and discuss ways of analyzing the sanitized data. This study provides a summary of the current state-of-the-art, based on which we expect to see advances in social networks data publishing for years to come.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Link disclosure between two individuals in a social network could be a privacy breach. To limit link disclosure, previous works modeled a social network as an undirected graph and randomized a link over the entire domain of links, which leads to considerable structural distortion to the graph. In this work, we address this issue in two steps. First, we model a social network as a directed graph and randomize the destination of a link while keeping the source of a link intact. The randomization ensures that, if the prior belief about the destination of a link is bounded by some threshold, the posterior belief, given the published graph, is no more than another threshold. Then, we further reduce structural distortion by a subgraph-wise perturbation in which the given graph is partitioned into several subgraphs and randomization of destination nodes is performed within each subgraph. The benefit of subgraph-wise perturbation is that it retains a destination node with a higher retention probability and replaces a destination node with a node from a local neighborhood. We study the trade-off of utility and privacy of subgraph-wise perturbation.
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the number of users of social network growing exponentially, the need of protecting the user privacy in network has gain the prime importance. While joining a social network, the user is requested to fill up a lot of unnecessary information like educational background, birth date, interests etc. This information may get leaked or mal-accessed if not protected with proper security measures. The data stored in social network may be attacked in different ways according to purpose of attack. In this paper we identify basic types of privacy breaches in social network. Secondly, we study the concept of Hippocratic principles. We propose a simple classification of the information requested from the user when he joins the social network. We also propose a privacy preserving model based on Hippocratic principles, specifically for Purpose, Limited Disclosure, Consent and compliance. Our proposed model work on privacy metadata, query analyzer is extended to check the define policy before giving the result out. This model can be used while mining on private data, which will help to enhance the privacy level of trustworthiness among internet users.
    Information and Communication Technologies (WICT), 2012 World Congress on; 01/2012


Available from