Xiaowei Ying
Xintao Wu
ABSTRACT
Many applications of social networks require identity and/or relationship anonymity due to the sensitive, stigmatizing, or confidential nature of user identities and their behaviors. Recent work showed that the simple technique of anonymizing graphs by replacing the identifying information of the nodes with random ids does not guarantee privacy since the identification of the nodes can be seriously jeopardized by applying background based attacks. In this paper, we investigate how well an edge based graph randomization approach can protect node identities and sensitive links. We quantify both identity disclosure and link disclosure when adversaries have one specific type of background knowledge (i.e., knowing the degrees of target individuals). We also conduct empirical comparisons with the recently proposed K-degree anonymization schemes in terms of both utility and risks of privacy disclosures.
- L. Adamic and N. Glance. The political blogosphere and the 2004 us election: divided they blog. In Proceedings of the WWW-2005 Workshop on the Weblogging Ecosystem, 2005.Google Scholar
- L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 181--190, New York, NY, USA, 2007. ACM Press. Google ScholarDigital Library
- L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 44--54, New York, NY, USA, 2006. ACM. Google ScholarDigital Library
- J. Baumes, M. K. Goldberg, M. Magdon-Ismail, and W. A. Wallace. Discovering hidden groups in communication networks. In ISI, pages 378--389, 2004.Google ScholarCross Ref
- T. Y. Berger-Wolf and J. Saia. A framework for analysis of dynamic social networks. In KDD, pages 523--528, 2006. Google ScholarDigital Library
- A. Campan and T. M. Truta. A clustering approach for data and structural anonymity in social networks. In PinKDD, 2008.Google Scholar
- L. da F. Costa, F. A. Rodrigues, G. Travieso, and P. R. V. Boas. Characterization of complex networks: A survey of measurements. Advances In Physics, 56:167, 2007.Google ScholarCross Ref
- A. Fast, D. Jensen, and B. N. Levine. Creating social networks to improve peer-to-peer networking. In KDD, pages 568--573, 2005. Google ScholarDigital Library
- M. Girvan and M. E. Newman. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA, 99(12):7821--7826, June 2002.Google ScholarCross Ref
- S. Hanhijarvi, G. C. Garriga, and K. Puolamaki. Randomization techniques for graphs. In Proc. of the 9th SIAM Conference on Data Mining, 2009.Google ScholarCross Ref
- M. Hay, G. Miklau, D. Jensen, D. Towsely, and P. Weis. Resisting structural re-identification in anonymized social networks. In VLDB, 2008. Google ScholarDigital Library
- M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. University of Massachusetts Technical Report, 07--19, 2007.Google Scholar
- D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137--146, 2003. Google ScholarDigital Library
- J. M. Kleinberg. Challenges in mining social network data: processes, privacy, and paradoxes. In KDD, pages 4--5, 2007. Google ScholarDigital Library
- Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In KDD, pages 245--255, 2006. Google ScholarDigital Library
- V. Krebs. http://www.orgnet.com/. 2006.Google Scholar
- R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In KDD, pages 611--617, 2006. Google ScholarDigital Library
- D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03: Proceedings of the twelfth international conference on Information and knowledge management, pages 556--559, New York, NY, USA, 2003. ACM. Google ScholarDigital Library
- K. Liu and E. Terzi. Towards identity anonymization on graphs. In Proceedings of the ACM SIGMOD Conference, Vancouver, Canada, 2008. ACM Press. Google ScholarDigital Library
- A. Seary and W. Richards. Spectral methods for analyzing and visualizing networks: an introduction. National Research Council, Dynamic Social Network Modelling and Analysis: Workshop Summary and Papers, pages 209--228, 2003.Google Scholar
- J. Shetty and J. Adibi. The Enron email dataset database schema and brief statistical report. Information Sciences Institute Technical Report, University of Southern California, 2004.Google Scholar
- M. Shiga, I. Takigawa, and H. Mamitsuka. A spectral clustering approach to optimally combining numericalvectors with a modular network. In KDD, pages 647--656, 2007. Google ScholarDigital Library
- E. Spertus, M. Sahami, and O. Buyukkokten. Evaluating similarity measures: a large-scale study in the orkut social network. In KDD, pages 678--684, 2005. Google ScholarDigital Library
- C. Tantipathananandh, T. Y. Berger-Wolf, and D. Kempe. A framework for community identification in dynamic social networks. In KDD, pages 717--726, 2007. Google ScholarDigital Library
- S. White and P. Smyth. Algorithms for estimating relative importance in networks. In KDD, pages 266--275, 2003. Google ScholarDigital Library
- X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In Proc. of the 8th SIAM Conference on Data Mining, April 2008.Google ScholarCross Ref
- X. Ying and X. Wu. Graph generation with prescribed feature constraints. In Proc. of the 9th SIAM Conference on Data Mining, 2009.Google ScholarCross Ref
- X. Ying and X. Wu. On link privacy in randomizing social networks. In PAKDD, 2009. Google ScholarDigital Library
- E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In PinKDD, pages 153--171, 2007. Google ScholarDigital Library
- B. Zhou and J. Pei. Preserving Privacy in Social Networks Against Neighborhood Attacks. IEEE 24th International Conference on Data Engineering, pages 506--515, 2008. Google ScholarDigital Library
- B. Zhou, J. Pei, and W.-S. Luk. A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explorations, 10(2), 2009. Google ScholarDigital Library
Index Terms
- Comparisons of randomization and K-degree anonymization schemes for privacy preserving social network publishing
Recommendations
A brief survey on anonymization techniques for privacy preserving publishing of social network data
Nowadays, partly driven by many Web 2.0 applications, more and more social network data has been made publicly available and analyzed in one way or another. Privacy preserving publishing of social network data becomes a more and more important concern. ...
Privacy Preserving Data Mining Techniques: Current Scenario and Future Prospects
ICCCT '12: Proceedings of the 2012 Third International Conference on Computer and Communication TechnologyPrivacy preserving has originated as an important concern with reference to the success of the data mining. Privacy preserving data mining (PPDM) deals with protecting the privacy of individual data or sensitive knowledge without sacrificing the utility ...
Multi-level privacy preserving data publishing
Policedata is an important source of social media data and can be regarded as a technical assistance to increase government accountability and transparency. Notably, it contains large amounts of personal private information that should be preserved ...
Comments