Anonymizing shortest paths on social network graphs

Authors:
Shyue-Liang Wang;Zheng-Ze Tsai;Tzung-Pei Hong;I-Hsien Ting
Affiliations:
Department of Information Management, National University of Kaohsiung, Kaohsiung, Taiwan;Department of Information Management, National University of Kaohsiung, Kaohsiung, Taiwan;Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan;Department of Information Management, National University of Kaohsiung, Kaohsiung, Taiwan
Venue:
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Year:
2011

Citing 11
Cited 3

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

Privacy Preservation by k-Anonymization of Weighted Social Networks

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Sensitive and Neighborhood Privacy on Shortest Paths in the Cloud

Proceedings of International Conference on Information Integration and Web-based Applications & Services
K-anonymous path privacy on social graphs

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Quantified Score

Hi-index	0.01

Visualization

Abstract

Social networking is gaining enormous popularity in the past few years. However, the popularity may also bring unexpected consequences for users regarding safety and privacy concerns. To prevent privacy being breached and modeling a social network as a weighted graph, many effective anonymization techniques have been proposed. 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. Greedy-based modification algorithms and experimental results showing the feasibility and characteristics of the proposed approach are presented.