An Effective Method for Utility Preserving Social Network Graph Anonymization Based on Mathematical Modeling

Authors

  • R. Mortazavi School of Engineering, Damghan University, Damghan, Iran
  • S. H. Erfani School of Engineering, Damghan University, Damghan, Iran
Abstract:

In recent years, privacy concerns about social network graph data publishing has increased due to the widespread use of such data for research purposes. This paper addresses the problem of identity disclosure risk of a node assuming that the adversary identifies one of its immediate neighbors in the published data. The related anonymity level of a graph is formulated and a mathematical model is proposed to solve the problem. The application of the method on a number of synthetic and real-world datasets confirms that the method is general and can be used in different contexts to produce superior results in terms of the utility of the anonymized graph.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Class-based graph anonymization for social network data

The recent rise in popularity of social networks, such as Facebook and MySpace, has created large quantities of data about interactions within these networks. Such data contains many private details about individuals so anonymization is required prior to attempts to make the data more widely available for scientific research. Prior work has considered simple graph data to be anonymized by remov...

full text

Utility-preserving anonymization for health data publishing

BACKGROUND Publishing raw electronic health records (EHRs) may be considered as a breach of the privacy of individuals because they usually contain sensitive information. A common practice for the privacy-preserving data publishing is to anonymize the data before publishing, and thus satisfy privacy models such as k-anonymity. Among various anonymization techniques, generalization is the most c...

full text

Utility-Oriented K-Anonymization on Social Networks

“Identity disclosure” problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in nontrivial utility loss. The reason is that the number of the edges modified when anonymizing the social network is the only metric to evaluate utility loss, not considering the fact that different edge modifications have d...

full text

An Anonymization Algorithm for (α, β, γ, δ)-Social Network Privacy Considering Data Utility

A well-known privacy-preserving network data publication problem focuses on how to publish social network data while protecting privacy and permitting useful analysis. Designing algorithms that safely transform network data is an active area of research. The process of applying these transformations is called anonymization operation. The authors recently proposed the (α,β,γ,δ)-SNP (Social Netwo...

full text

A Behavior-based Approach Towards Statistics-Preserving Network Trace Anonymization

A Behavior-based Approach Towards Statistics-Preserving Network Trace

full text

Information based data anonymization for classification utility

Article history: Received 27 September 2010 Received in revised form 10 April 2011 Accepted 5 July 2011 Available online 22 July 2011 Anonymization is a practical approach to protect privacy in data. The major objective of privacy preserving data publishing is to protect private information in data whereas data is still useful for some intended applications, such as building classification mode...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 31  issue 10

pages  1624- 1632

publication date 2018-10-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023