Sciweavers

Share
PVLDB
2008

Anonymizing bipartite graph data using safe groupings

9 years 9 months ago
Anonymizing bipartite graph data using safe groupings
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a large, sparse bipartite graph. As with tabular data, it is desirable to be able to publish anonymized versions of such data, to allow others to perform ad hoc analysis of aggregate graph properties. However, existing tabular anonymization techniques do not give useful or meaningful results when applied to graphs: small changes or masking of the edge structure can radically change aggregate graph properties. We introduce a new family of anonymizations, for bipartite graph data, called (k, )-groupings. These groupings preserve the underlying graph structure perfectly, and instead anonymize the mapping from entities to nodes of the graph. We identify a class of "safe" (k, )-groupings that have provable guarantees to resist a variety of attacks, and show how to find such safe groupings. We perform experimen...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z
Added 28 Dec 2010
Updated 28 Dec 2010
Type Journal
Year 2008
Where PVLDB
Authors Graham Cormode, Divesh Srivastava, Ting Yu, Qing Zhang
Comments (0)
books