Li, Y.Shen, H.2011-08-042011-08-042010Proceedings of 11th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2010), 2010: pp.166-1749780769542874http://hdl.handle.net/2440/65299As an integral part of data security, identity disclosure is a major privacy breach, which reveals the identification of entities with certain background knowledge known by an adversary. Most recent studies on this problem focus on the protection of relational data or simple graph data (i.e. undirected, unweighted and acyclic). However, a weighted graph can introduce much more unique information than its simple version, which makes the disclosure easier. As more real-world graphs or social networks are released publicly, there is growing concern about privacy breaching for the entities involved. In this paper, we first formalize a general anonymizing model to deal with weight-related attacks, and discuss an efficient metric to quantify information loss incurred in the perturbation. Then we consider a very practical attack based on the sum of adjacent weights for each vertex, which is known as volume in graph theory field. We also propose a complete solution for the weight anonymization problem to prevent a graph from volume attack. Our approachesare efficient and practical, and have been validated by extensive experiments on both synthetic and real-world datasets.en© 2010 IEEEAnonymityWeighted GraphPrivacy Preserving Graph MiningWeight AnonymizationConference paper002010544510.1109/PDCAT.2010.232-s2.0-7995178787431179Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]