Anonymizing bipartite graph data using safe groupings

Graham Cormode, Divesh Srivastava, Ting Yu, Qing Zhang

Research output: Chapter in Book/Report/Conference proceedingChapter

103 Citations (Scopus)

Abstract

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, l)-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, l)-groupings that have provable guarantees to resist a variety of attacks, and show how to find such safe groupings. We perform experiments on real bipartite graph data to study the utility of the anonymized version, and the impact of publishing alternate groupings of the same graph data. Our experiments demonstrate that (k, l)-groupings offer strong tradeoffs between privacy and utility.

Original languageEnglish
Title of host publicationProceedings of the VLDB Endowment
Pages833-844
Number of pages12
Volume1
Edition1
Publication statusPublished - 2008
Externally publishedYes

Fingerprint

Experiments

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Cormode, G., Srivastava, D., Yu, T., & Zhang, Q. (2008). Anonymizing bipartite graph data using safe groupings. In Proceedings of the VLDB Endowment (1 ed., Vol. 1, pp. 833-844)

Anonymizing bipartite graph data using safe groupings. / Cormode, Graham; Srivastava, Divesh; Yu, Ting; Zhang, Qing.

Proceedings of the VLDB Endowment. Vol. 1 1. ed. 2008. p. 833-844.

Research output: Chapter in Book/Report/Conference proceedingChapter

Cormode, G, Srivastava, D, Yu, T & Zhang, Q 2008, Anonymizing bipartite graph data using safe groupings. in Proceedings of the VLDB Endowment. 1 edn, vol. 1, pp. 833-844.
Cormode G, Srivastava D, Yu T, Zhang Q. Anonymizing bipartite graph data using safe groupings. In Proceedings of the VLDB Endowment. 1 ed. Vol. 1. 2008. p. 833-844
Cormode, Graham ; Srivastava, Divesh ; Yu, Ting ; Zhang, Qing. / Anonymizing bipartite graph data using safe groupings. Proceedings of the VLDB Endowment. Vol. 1 1. ed. 2008. pp. 833-844
@inbook{5543d0e3426a46eaac16ed2291542d10,
title = "Anonymizing bipartite graph data using safe groupings",
abstract = "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, l)-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, l)-groupings that have provable guarantees to resist a variety of attacks, and show how to find such safe groupings. We perform experiments on real bipartite graph data to study the utility of the anonymized version, and the impact of publishing alternate groupings of the same graph data. Our experiments demonstrate that (k, l)-groupings offer strong tradeoffs between privacy and utility.",
author = "Graham Cormode and Divesh Srivastava and Ting Yu and Qing Zhang",
year = "2008",
language = "English",
volume = "1",
pages = "833--844",
booktitle = "Proceedings of the VLDB Endowment",
edition = "1",

}

TY - CHAP

T1 - Anonymizing bipartite graph data using safe groupings

AU - Cormode, Graham

AU - Srivastava, Divesh

AU - Yu, Ting

AU - Zhang, Qing

PY - 2008

Y1 - 2008

N2 - 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, l)-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, l)-groupings that have provable guarantees to resist a variety of attacks, and show how to find such safe groupings. We perform experiments on real bipartite graph data to study the utility of the anonymized version, and the impact of publishing alternate groupings of the same graph data. Our experiments demonstrate that (k, l)-groupings offer strong tradeoffs between privacy and utility.

AB - 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, l)-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, l)-groupings that have provable guarantees to resist a variety of attacks, and show how to find such safe groupings. We perform experiments on real bipartite graph data to study the utility of the anonymized version, and the impact of publishing alternate groupings of the same graph data. Our experiments demonstrate that (k, l)-groupings offer strong tradeoffs between privacy and utility.

UR - http://www.scopus.com/inward/record.url?scp=72749109110&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72749109110&partnerID=8YFLogxK

M3 - Chapter

VL - 1

SP - 833

EP - 844

BT - Proceedings of the VLDB Endowment

ER -