Privacy preserving social network publication on bipartite graphs

Authors:
Jian Zhou;Jiwu Jing;Ji Xiang;Lei Wang
Affiliations:
The State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, China;The State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, China;The State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, China;The State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, China
Venue:
WISTP'12 Proceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems
Year:
2012

Citing 10
Cited 0

Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
k-anonymity: a model for protecting privacy

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
L-diversity: Privacy beyond k-anonymity

ACM Transactions on Knowledge Discovery from Data (TKDD)
Preserving Privacy in Social Networks Against Neighborhood Attacks

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
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
Anonymizing bipartite graph data using safe groupings

The VLDB Journal — The International Journal on Very Large Data Bases
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
K-isomorphism: privacy preserving network publication against structural attacks

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Resisting structural re-identification in anonymized social networks

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In social networks, some data may come in the form of bipartite graphs, where properties of nodes are public while the associations between two nodes are private and should be protected. When publishing the above data, in order to protect privacy, we propose to adopt the idea generalizing the graphs to super-nodes and super-edges. We investigate the problem of how to preserve utility as much as possible and propose an approach to partition the nodes in the process of generalization. Our approach can give privacy guarantees against both static attacks and dynamic attacks, and at the same time effectively answer aggregate queries on published data.