NDLI: Preserving structural properties in anonymization of social networks

Content Provider	IEEE Xplore Digital Library
Author	Masoumzadeh, A. Joshi, J.
Copyright Year	2010
Description	Author affiliation: Sch. of Inf. Sci., Univ. of Pittsburgh, Pittsburgh, PA, USA (Masoumzadeh, A.; Joshi, J.)
Abstract	A social network is a collection of social entities and the relations among them. Collection and sharing of such network data for analysis raise significant privacy concerns for the involved individuals, especially when human users are involved. To address such privacy concerns, several techniques, such as k-anonymity based approaches, have been proposed in the literature. However, such approaches introduce a large amount of distortion to the original social network graphs, thus raising serious questions about their utility for useful social network analysis. Consequently, these techniques may never be applied in practice. In this paper, we emphasize the use of network structural semantics in the social network analysis theory to address this problem. We propose an approach for enhancing anonymization techniques that preserves the structural semantics of the original social network by using the notion of roles and positions. We present experimental results that demonstrate that our approach can significantly help in preserving graph and social network theoretic properties of the original social networks, and hence improve utility of the anonymized data.
Starting Page	1
Ending Page	10
File Size	1669080
Page Count	10
File Format	PDF
e-ISBN	9780984589326
DOI	10.4108/icst.collaboratecom.2010.7
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-10-09
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	ICST
Subject Keyword	Educational institutions Partitioning algorithms
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

Preserving Structural Properties in Edge-Perturbing Anonymization Techniques for Social Networks

Confining Edge Types in K-anonymization of Shortest Paths

A utility preserving data-oriented anonymization method based on data ordering

Social Network Privacy for Attribute Disclosure Attacks

Preserving Patterns in Bipartite Graph Partitioning

Synergistic partitioning in multiple large scale social networks

On clustering networks with PageRank

On anonymizing social network graphs

Incremental algorithm for detecting community structure in dynamic networks

Preserving structural properties in anonymization of social networks

Similar Documents

Preserving Structural Properties in Edge-Perturbing Anonymization Techniques for Social Networks

Confining Edge Types in K-anonymization of Shortest Paths

A utility preserving data-oriented anonymization method based on data ordering

Social Network Privacy for Attribute Disclosure Attacks

Preserving Patterns in Bipartite Graph Partitioning

Synergistic partitioning in multiple large scale social networks

On clustering networks with PageRank

On anonymizing social network graphs

Incremental algorithm for detecting community structure in dynamic networks

Preserving structural properties in anonymization of social networks