Graph anonymization through edge and vertex addition

Simple item page
dc.contributor.authorSrivastava, Gautam
dc.contributor.supervisorSrinivasan, Venkatesh
dc.contributor.supervisorKapron, Bruce
dc.date.accessioned2011-12-20T23:10:28Z
dc.date.available2011-12-20T23:10:28Z
dc.date.copyright2011en_US
dc.date.issued2011-12-20
dc.degree.departmentDepartment of Computer Science
dc.degree.levelDoctor of Philosophy Ph.D.en_US
dc.description.abstractWith an abundance of social network data being released, the need to protect sensitive information within these networks has become an important concern of data publishers. In this thesis we focus on the popular notion of k-anonymization as applied to social network graphs. Given such a network N, the problem we study is to transform N to N', such that some property P of each node in N' is attained by at least k-1 other nodes in N'. We study edge-labeled, vertex-labeled and unlabeled graphs, since instances of each occur in real-world social networks. Our main contributions are as follows 1. When looking at edge additions, we show that k-label sequence anonymity of arbitrary edge-labeled graphs is NP-complete, and use this fact to prove hardness results for many other recently introduced notions of anonymity. We also present interesting hardness results and algorithms for labeled and unlabeled bipartite graphs. 2. When looking at node additions, we show that on vertex-labeled graphs, the problem is NP-complete. For unlabeled graphs, we give an efficient (near-linear) algorithm and show that it gives solutions that are optimal modulo k, a guarantee that is novel in the literature. We examine anonymization both from its theoretical foundations and empirically, showing that our proposed algorithms for anonymization maintain structural properties shown to be necessary for graph analysis.en_US
dc.description.scholarlevelGraduateen_US
dc.identifier.bibliographicCitationSean Chester, Bruce Kapron, Ganesh Ramesh, Gautam Srivastava, and S. Venkatesh. k-anonymization of social networks by vertex addition. In Advances in Databases and Information Systems, ADBIS, 2011.en_US
dc.identifier.bibliographicCitationSean Chester and Gautam Srivastava. Social network privacy for attribute disclosure attacks. In Advances in Social Networks Analysis and Mining, ASONAM, 2011.en_US
dc.identifier.bibliographicCitationBruce Kapron, Gautam Srivastava, and S. Venkatesh. Social network anonymization via edge addition. In Advances in Social Networks Analysis and Mining, ASONAM, 2011.en_US
dc.identifier.urihttp://hdl.handle.net/1828/3755
dc.languageEnglisheng
dc.language.isoenen_US
dc.rights.tempAvailable to the World Wide Weben_US
dc.subjectanonymizationen_US
dc.subjectcomplexityen_US
dc.subjectsocial networksen_US
dc.subjectalgorithmsen_US
dc.subjectalpha-proximityen_US
dc.subjectsecurityen_US
dc.subjectprivacyen_US
dc.subjectgraphsen_US
dc.titleGraph anonymization through edge and vertex additionen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Srivastava_Gautam_PhD_2011.pdf
Size:
1.03 MB
Format:
Adobe Portable Document Format
Description:
Thesis Final
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.