The Community for Technology Leaders
RSS Icon
Issue No.06 - Nov.-Dec. (2012 vol.9)
pp: 877-889
Amirreza Masoumzadeh , University of Pittsburgh, Pittsburgh
James Joshi , University of Pittsburgh, Pittsburgh
Social networks are attracting significant interest from researchers in different domains, especially with the advent of social networking systems which enable large-scale collection of network information. However, as much as analysis of such social networks can benefit researchers, it raises serious privacy concerns for the people involved in them. To address such privacy concerns, several techniques, such as k-anonymity-based approaches, have been proposed in the literature to provide user anonymity in published social networks. However, these methods usually 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. We propose two methods to enhance edge-perturbing anonymization methods based on the concepts of structural roles and edge betweenness in social network theory. We experimentally show significant improvements in preserving structural properties in an anonymized social network achieved by our approach compared to the original algorithms over several data sets.
Social network services, Partitioning algorithms, Privacy, Algorithm design and analysis, Data privacy, Semantics, Clustering algorithms, data perturbation, Privacy, social network, social network analysis, data anonymization
Amirreza Masoumzadeh, James Joshi, "Preserving Structural Properties in Edge-Perturbing Anonymization Techniques for Social Networks", IEEE Transactions on Dependable and Secure Computing, vol.9, no. 6, pp. 877-889, Nov.-Dec. 2012, doi:10.1109/TDSC.2012.65
[1] L. Backstrom, C. Dwork, and J. Kleinberg, "Wherefore Art Thou r3579x?: Anonymized Social Networks, Hidden Patterns, and Structural Steganography," Proc. 16th Int'l Conf. World Wide Web, pp. 181-190, 2007.
[2] M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava, "Anonymizing Social Networks," Technical Report 07-19, Univ. of Massachusetts Amherst, 2007.
[3] A. Narayanan and V. Shmatikov, "De-Anonymizing Social Networks," Proc. IEEE 30th Symp. Security and Privacy, pp. 173-187, Aug. 2009.
[4] M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis, "Resisting Structural Re-Identification in Anonymized Social Networks," Proc. VLDB Endowment, vol. 1, no. 1, pp. 102-114, Aug. 2008.
[5] E. Zheleva and L. Getoor, "Preserving the Privacy of Sensitive Relationships in Graph Data," Proc. First ACM SIGKDD Int'l Conf. Privacy, Security, and Trust in KDD, F. Bonchi, E. Ferrari, B. Malin, and Y. Saygin, eds., pp. 153-171, 2008.
[6] A. Campan and T.M. Truta, "A Clustering Approach for Data and Structural Anonymity in Social Networks," Proc. Second ACM SIGKDD Int'l Workshop Privacy, Security, and Trust in KDD (PinKDD '08), in Conjunction with KDD '08, 2008.
[7] X. Ying, K. Pan, X. Wu, and L. Guo, "Comparisons of Randomization and K-Degree Anonymization Schemes for Privacy Preserving Social Network Publishing," SNA-KDD '09: Proc. Third Workshop Social Network Mining and Analysis, pp. 1-10, 2009.
[8] K. Liu and E. Terzi, "Towards Identity Anonymization on Graphs," SIGMOD '08: Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 93-106, 2008.
[9] B. Thompson and D. Yao, "The Union-Split Algorithm and Cluster-Based Anonymization of Social Networks," ASIACCS '09: Proc. Fourth Int'l Symp. Information, Computer, and Comm. Security, pp. 218-227, 2009.
[10] B. Zhou and J. Pei, "Preserving Privacy in Social Networks Against Neighborhood Attacks," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE), pp. 506-515, 2008.
[11] X. He, J. Vaidya, B. Shafiq, N. Adam, and V. Atluri, "Preserving Privacy in Social Networks: A Structure-Aware Approach," WI-IAT '09: Proc. IEEE/WIC/ACM Int'l Joint Conf. Web Intelligence and Intelligent Agent Technology, vol. 1, pp. 647-654, 2009.
[12] L. Sweeney, "K-Anonymity: A Model for Protecting Privacy," Int'l J. Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002.
[13] A. Masoumzadeh and J. Joshi, "Preserving Structural Properties in Anonymization of Social Networks," Proc. Sixth Int'l Conf. Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom '10), Oct. 2010.
[14] S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.
[15] M. Newman, Networks: An Introduction, first ed. Oxford Univ. Press, May 2010.
[16] D. Knoke and S. Yang, Social Network Analysis (Quantitative Applications in the Social Sciences), second ed. Sage Publications, Inc., Nov. 2008.
[17] J. Lerner, "Role Assignments," Proc. Network Analysis, LNCS, U. Brandes and T. Erlebach, Eds. Springer Berlin/Heidelberg, vol. 3418, pp. 216-252, 2005.
[18] S. Borgatti, "Two Algorithms for Computing Regular Equivalence," Social Networks, vol. 15, no. 4, pp. 361-376, 1993.
[19] M.E.J. Newman and M. Girvan, "Finding and Evaluating Community Structure in Networks," Physical Rev. E, vol. 69, no. 2, p. 026113, Feb. 2004.
[20] P. Gleiser and L. Danon, "Community Structure in Jazz," Advances in Complex Systems, vol. 6, no. 4, pp. 565-573, 2003.
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool