Access the full text.
Sign up today, get DeepDyve free for 14 days.
Y. Chen (1995)
[The change of serum alpha 1-antitrypsin level in patients with spontaneous pneumothorax].Zhonghua jie he he hu xi za zhi = Zhonghua jiehe he huxi zazhi = Chinese journal of tuberculosis and respiratory diseases, 18 4
L. Sweeney (2002)
k-Anonymity: A Model for Protecting PrivacyInt. J. Uncertain. Fuzziness Knowl. Based Syst., 10
Graham Cormode, D. Srivastava, Smriti Bhagat, B. Krishnamurthy (2009)
Class-based graph anonymization for social network dataProc. VLDB Endow., 2
Manolis Terrovitis, N. Mamoulis, Panos Kalnis (2008)
Privacy-preserving anonymization of set-valued dataProc. VLDB Endow., 1
E. Zheleva, L. Getoor (2007)
Preserving the Privacy of Sensitive Relationships in Graph Data
J. Bennett, S. Lanning (2007)
The Netflix Prize
Yabo Xu, Ke Wang, A. Fu, Philip Yu (2008)
Anonymizing transaction databases for publication
Arvind Narayanan, Vitaly Shmatikov (2006)
How To Break Anonymity of the Netflix Prize DatasetArXiv, abs/cs/0610105
Michael Hay, G. Miklau, David Jensen, D. Towsley, Chao Li (2008)
Resisting structural re-identification in anonymized social networksThe VLDB Journal, 19
Bin Zhou, J. Pei (2008)
Preserving Privacy in Social Networks Against Neighborhood Attacks2008 IEEE 24th International Conference on Data Engineering
R. Wong, Jiuyong Li, A. Fu, Ke Wang (2006)
(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing
Xiaokui Xiao, Yufei Tao (2007)
M-invariance: towards privacy preserving re-publication of dynamic datasets
Michael Hay, G. Miklau, David Jensen, Philipp Weis, Siddharth Srivastava (2007)
Anonymizing Social Networks
Gabriel Ghinita, Yufei Tao, Panos Kalnis (2008)
On the Anonymization of Sparse High-Dimensional Data2008 IEEE 24th International Conference on Data Engineering
M. Nergiz, Chris Clifton, A. Nergiz (2007)
Multirelational k-AnonymityIEEE Transactions on Knowledge and Data Engineering, 21
Qing Zhang, Nick Koudas, D. Srivastava, Ting Yu (2007)
Aggregate Query Answering on Anonymized Tables2007 IEEE 23rd International Conference on Data Engineering
R. Wong, A. Fu, Ke Wang, J. Pei (2007)
Minimality Attack in Privacy Preserving Data Publishing
Ninghui Li, Tiancheng Li, Suresh Venkatasubramanian (2007)
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity2007 IEEE 23rd International Conference on Data Engineering
Ashwin Machanavajjhala, J. Gehrke, Daniel Kifer, Muthuramakrishnan Venkitasubramaniam (2006)
L-diversity: privacy beyond k-anonymity22nd International Conference on Data Engineering (ICDE'06)
M.R. Garey, D.S. Johnson (1979)
Computers and Intractability, a Guide to the Theory of NP-Completeness
Yufei Tao, Xiaokui Xiao (2006)
Personalized privacy preservationProceedings of the 2006 ACM SIGMOD international conference on Management of data
L. Backstrom, C. Dwork, J. Kleinberg (2007)
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography
David Martin, Daniel Kifer, Ashwin Machanavajjhala, J. Gehrke, Joseph Halpern (2007)
Worst-Case Background Knowledge for Privacy-Preserving Data Publishing2007 IEEE 23rd International Conference on Data Engineering
Carlos Matusevich (2018)
Privacy in Social Networks
A. Campan, T. Truta (2009)
Data and Structural k-Anonymity in Social Networks
P. Samarati (2001)
Protecting Respondents' Identities in Microdata ReleaseIEEE Trans. Knowl. Data Eng., 13
Xiaokui Xiao, Yufei Tao (2006)
Anatomy: simple and effective privacy preservation
A. Campan, T. Truta (2008)
A Clustering Approach for Data and Structural Anonymity in Social Networks
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
Private data often come 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 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, ℓ )-groupings offer strong tradeoffs between privacy and utility.
The VLDB Journal – Springer Journals
Published: Feb 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.