Generalizing data to provide anonymity when disclosing information (abstract)
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Hardness of Approximating Graph Transformation Problem
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 16th international conference on World Wide Web
Challenges in mining social network data: processes, privacy, and paradoxes
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards identity anonymization on graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Semantic based collaborative P2P in ubiquitous computing
Web Intelligence and Agent Systems
Community-driven ontology construction in social networking portals
Web Intelligence and Agent Systems
Resisting structural re-identification in anonymized social networks
Proceedings of the VLDB Endowment
Anonymizing bipartite graph data using safe groupings
Proceedings of the VLDB Endowment
Link Privacy in Social Networks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Preserving Privacy in Social Networks Against Neighborhood Attacks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
De-anonymizing Social Networks
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
Preserving Privacy in Social Networks: A Structure-Aware Approach
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Class-based graph anonymization for social network data
Proceedings of the VLDB Endowment
k-automorphism: a general framework for privacy preserving network publication
Proceedings of the VLDB Endowment
Preserving the privacy of sensitive relationships in graph data
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
A quantitative comparison of the subgraph miners mofa, gspan, FFSM, and gaston
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Hi-index | 0.00 |
Graph structured data can be ubiquitously found in the real world. For example, social networks can easily be represented as graphs where the graph connotes the complex sets of relationships between members of social systems. While their analysis could be beneficial in many aspects, publishing certain types of social networks raises significant privacy concerns. This brings the problem of graph anonymization into sharp focus. Unlike relational data, the true information in graph structured data is encoded within the structure and graph properties. Motivated by this, a structure-aware anonymization approach is proposed that maximally preserves the structure of the original network as well as its structural properties while anonymizing it. Instead of anonymizing each node one by one independently, the approach treats each partitioned substructural component of the network as one single unit to be anonymized. This maximizes utility while enabling anonymization. Since grouping and matching local structures are the essential steps for the anonymization, several alternative grouping and matching techniques are proposed and compared. The proposed methods are applied to both synthetic and real datasets to demonstrate their effectiveness and practical usefulness.