2012 · 44 citations · 12 references
ComputingComputer ScienceCryptographyNetwork SecurityPrivacy EngineeringData AnonymizationData ProtectionDisclosure ProtectionEdge PrivacyPrivacy-preserving AnalyticsSocial Network AnalysisAnonymizationAnonymization AlgorithmsAnonymization For Graph DataIdentity DisclosureK-anonymityPrivacy PreservationPrivacy-preserving Data AnalysisUtility-privacy Tradeoff
Privacy preserving analysis of a social network aims at a better understanding of the network and its behavior, while at the same time protecting the privacy of its individuals. We propose an anonymization method for weighted graphs, i.e., for social networks where the strengths of links are important. This is in contrast with many previous studies which only consider unweighted graphs. Weights can be essential for social network analysis, but they pose new challenges to privacy preserving network analysis. In this paper, we mainly consider prevention of identity disclosure, but we also touch on edge and edge weight disclosure in weighted graphs. We propose a method that provides k-anonymity of nodes against attacks where the adversary has information about the structure of the network, including its edge weights. The method is efficient, and it has been evaluated in terms of privacy and utility on real word datasets.
12
Lars Bäckström, Cynthia Dwork, Jon Kleinberg · 2007 · 850 citations
Resisting structural re-identification in anonymized social networks
Michael Hay, Gerome Miklau, David Jensen et al. · Proceedings of the VLDB Endowment · 2008 · 544 citations · Full text
Lei Zou, Lei Chen, M. TAMER ÖZSU · Proceedings of the VLDB Endowment · 2009 · 407 citations