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
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Hardness of Approximating Graph Transformation Problem
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
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
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
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
Relationships and data sanitization: a study in scarlet
Proceedings of the 2010 workshop on New security paradigms
Secure collaborative social networks
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Privacy-preserving social network publication against friendship attacks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A secret sharing based privacy enforcement mechanism for untrusted social networking operators
MiFor '11 Proceedings of the 3rd international ACM workshop on Multimedia in forensics and intelligence
Stalking online: on user privacy in social networks
Proceedings of the second ACM conference on Data and Application Security and Privacy
Structure-aware graph anonymization
Web Intelligence and Agent Systems
| 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, we propose a structure aware anonymization approach 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, our approach treats each partitioned substructural component of the network as one single unit to be anonymized. This maximizes utility while enabling anonymization. We apply our method to both synthetic and real datasets and demonstrate its effectiveness and practical usefulness.