An algorithm for k-degree anonymity on large networks

Authors:
Jordi Casas-Roma;Jordi Herrera-Joancomartí;Vicenç Torra
Affiliations:
Universitat Oberta de Catalunya, Barcelona, Spain;Universitat Autònoma de Barcelona, Bellaterra, Spain;Spanish National Research Council, Bellaterra, Spain
Venue:
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Year:
2013

Citing 11
Cited 0

k-anonymity: a model for protecting privacy

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
A Polynomial Algorithm for Optimal Univariate Microaggregation

IEEE Transactions on Knowledge and Data Engineering
Graph evolution: Densification and shrinking diameters

ACM Transactions on Knowledge Discovery from Data (TKDD)
The dynamics of viral marketing

ACM Transactions on the Web (TWEB)
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography

Proceedings of the 16th international conference on World Wide Web
Towards identity anonymization on graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Resisting structural re-identification in anonymized social networks

Proceedings of the VLDB Endowment
Preserving Privacy in Social Networks Against Neighborhood Attacks

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
k-automorphism: a general framework for privacy preserving network publication

Proceedings of the VLDB Endowment
Comparisons of randomization and K-degree anonymization schemes for privacy preserving social network publishing

Proceedings of the 3rd Workshop on Social Network Mining and Analysis
Differential privacy

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of anonymization on large networks. There are some anonymization methods for networks, but most of them can not be applied on large networks because of their complexity. We present an algorithm for k-degree anonymity on large networks. Given a network G, we construct a k-degree anonymous network, G, by the minimum number of edge modifications. We devise a simple and efficient algorithm for solving this problem on large networks. Our algorithm uses univariate micro-aggregation to anonymize the degree sequence, and then it modifies the graph structure to meet the k-degree anonymous sequence. We apply our algorithm to a different large real datasets and demonstrate their efficiency and practical utility.