NDLI: On the Hardness of Graph Anonymization

Content Provider	IEEE Xplore Digital Library
Author	Aggarwal, C.C. Yao Li Yu, P.S.
Copyright Year	2011
Abstract	In this paper, we examine the problem of node re-identification from anonymized graphs. Typical graphs encountered in real applications are massive and sparse. In this paper, we will show that massive and sparse graphs have certain theoretical properties which make them susceptible to re-identification attacks. We design a systematic way to exploit these theoretical properties in order to construct {\em re-identification signatures}, which are also known as characteristic vectors. These signatures have the property that they are extremely robust to perturbations, especially for massive and sparse graphs. Our results show that even low levels of anonymization require perturbation levels which are significant enough to result in a massive loss of utility. Our experimental results also show that the true anonymization level of graphs is much lower than is implied by measures such as $k$-anonymity. Thus, the results of this paper establish that the problem of massive graph anonymization has fundamental theoretical barriers which prevent a fully effective solution.
Starting Page	1002
Ending Page	1007
File Size	226405
Page Count	6
File Format	PDF
ISBN	9781457720758
ISSN	15504786
DOI	10.1109/ICDM.2011.112
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-12-11
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vectors Couplings Robustness Approximation methods Social network services Privacy Random variables anonymization graphs privacy
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the privacy of anonymized networks

On Identity Disclosure in Weighted Graphs

Anonymizing Graphs Against Weight-Based Attacks

Delineating social network data anonymization via random edge perturbation

Preserving Utility in Social Network Graph Anonymization

Graph Anonymization Using Machine Learning

Social Network Anonymization via Edge Addition

Preserving privacy in social network graph with K-anonymize degree sequence generation

Impact of Clustering on the Performance of Network De-anonymization

On the Hardness of Graph Anonymization

Similar Documents

On the privacy of anonymized networks

On Identity Disclosure in Weighted Graphs

Anonymizing Graphs Against Weight-Based Attacks

Delineating social network data anonymization via random edge perturbation

Preserving Utility in Social Network Graph Anonymization

Graph Anonymization Using Machine Learning

Social Network Anonymization via Edge Addition

Preserving privacy in social network graph with K-anonymize degree sequence generation

Impact of Clustering on the Performance of Network De-anonymization

On the Hardness of Graph Anonymization