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
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
On the complexity of optimal K-anonymity
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximate algorithms for K-anonymity
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
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
Anonymization of set-valued data via top-down, local generalization
Proceedings of the VLDB Endowment
k-automorphism: a general framework for privacy preserving network publication
Proceedings of the VLDB Endowment
K-isomorphism: privacy preserving network publication against structural attacks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Preventing range disclosure in k-anonymised data
Expert Systems with Applications: An International Journal
Anonymizing shortest paths on social network graphs
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Hi-index | 0.00 |
Growing popularity of social networking not only brings the convenience of information sharing but also concerns of privacy breaches. Information on social networks can be modeled as un-weighted or weighted graph data. To preserve privacy, k-anonymity on relational, set-valued, and graph data have been studied extensively in recent years. In this work, we consider the edge weight anonymity problem. In particular, to protect the weight privacy of the shortest path between two vertices on a weighted graph, we present a new concept called k-anonymous path privacy. A published social network graph with k-anonymous path privacy has at least k indistinguishable shortest paths between the source and destination vertices. Three greedy-based modification algorithms, based on modifying different types of edges, to achieve k-anonymous path privacy are proposed. Experimental results showing the feasibility and characteristics of the proposed approach are presented. The proposed techniques clearly provide different options to achieve the same level of privacy under different requirements.