NDLI: Privacy Risk in Graph Stream Publishing for Social Network Data

Content Provider	IEEE Xplore Digital Library
Author	Medforth, N. Ke Wang
Copyright Year	2011
Abstract	To understand how social networks evolve over time, graphs representing the networks need to be published periodically or on-demand. The identity of the participants (nodes) must be anonymized to protect the privacy of the individuals and their relationships (edges) to the other members in the social network. We identify a new form of privacy attack, which we name the degree-trail attack. This attack re-identifies the nodes belonging to a target participant from a sequence of published graphs by comparing the degree of the nodes in the published graphs with the degree evolution of a target. The power of this attack is that the adversary can actively influence the degree of the target individual by interacting with the social network. We show that the adversary can succeed with a high probability even if published graphs are anonymized by strongest known privacy preserving techniques in the literature. Moreover, this success does not depend on the distinctiveness of the target nodes nor require the adversary to behave differently from a normal participant. One of our contributions is a formal method to assess the privacy risk of this type of attacks and empirically study the severity on real social network data.
Starting Page	437
Ending Page	446
File Size	727586
Page Count	10
File Format	PDF
ISBN	9781457720758
ISSN	15504786
DOI	10.1109/ICDM.2011.120
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	Social network services Privacy Pins Data privacy Handheld computers Educational institutions data publishing social network privacy anonymity
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

An Improved Privacy Preserving Algorithm for Publishing Social Network Data

Personalized anonymity in social networks data publication

Privacy risk in graph stream publishing for social network data (2011)

Relationship Privacy Preservation in Publishing Online Social Networks

A General Framework for Publishing Privacy Protected and Utility Preserved Graph

Anonymizing Multiple K-anonymous Shortest Paths for Social Graphs

Content-Based De-anonymisation of Tweets

The (P, α, K) anonymity model for privacy protection of personal information in the social networks

A Privacy-Preserving Data Publishing Method for Multiple Numerical Sensitive Attributes via Clustering and Multi-sensitive Bucketization

Privacy Risk in Graph Stream Publishing for Social Network Data

Similar Documents

An Improved Privacy Preserving Algorithm for Publishing Social Network Data

Personalized anonymity in social networks data publication

Privacy risk in graph stream publishing for social network data (2011)

Relationship Privacy Preservation in Publishing Online Social Networks

A General Framework for Publishing Privacy Protected and Utility Preserved Graph

Anonymizing Multiple K-anonymous Shortest Paths for Social Graphs

Content-Based De-anonymisation of Tweets

The (P, α, K) anonymity model for privacy protection of personal information in the social networks

A Privacy-Preserving Data Publishing Method for Multiple Numerical Sensitive Attributes via Clustering and Multi-sensitive Bucketization

Privacy Risk in Graph Stream Publishing for Social Network Data