Abstract
Motivated by a strongly growing interest in anonymizing social network data, we investigate the NP-hard Degree Anonymization problem: given an undirected graph, the task is to add a minimum number of edges such that the graph becomes k-anonymous. That is, for each vertex there have to be at least k − 1 other vertices of exactly the same degree. The model of degree anonymization has been introduced by Liu and Terzi [ACM SIGMOD’08], who also proposed and evaluated a two-phase heuristic. We present an enhancement of this heuristic, including new algorithms for each phase which significantly improve on the previously known theoretical and practical running times. Moreover, our algorithms are optimized for large-scale social networks and provide upper and lower bounds for the optimal solution. Notably, on about 26 % of the real-world data we provide (provably) optimal solutions; whereas in the other cases our upper bounds significantly improve on known heuristic solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Berthomé, P., Lalande, J.-F., Levorato, V.: Implementation of exponential and parametrized algorithms in the AGAPE project. CoRR, abs/1201.5985 (2012)
Casas-Roma, J., Herrera-Joancomartí, J., Torra, V.: An algorithm for k-degree anonymity on large networks. In: Proc. ASONAM 2013, pp. 671–675. ACM Press (2013)
Chester, S., Gaertner, J., Stege, U., Venkatesh, S.: Anonymizing subsets of social networks with degree constrained subgraphs. In: Proc. ASONAM 2012, pp. 418–422. IEEE Computer Society (2012)
DIMACS 2012. Graph partitioning and graph clustering. 10th DIMACS challenge (2012), http://www.cc.gatech.edu/dimacs10/ (accessed April 2012)
Easley, D., Kleinberg, J.: Networks, Crowds, and Markets. Cambridge University Press (2010)
Erdős, P., Gallai, T.: Graphs with prescribed degrees of vertices. Math. Lapok 11, 264–274 (1960) (in Hungarian)
Fung, B.C.M., Wang, K., Chen, R., Yu, P.S.: Privacy-preserving data publishing: A survey of recent developments. ACM Computing Surveys 42(4), 14:1–14:53 (2010)
Hartung, S., Nichterlein, A., Niedermeier, R., Suchý, O.: A refined complexity analysis of degree anonymization in graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 594–606. Springer, Heidelberg (2013)
Hartung, S., Hoffmann, C., Nichterlein, A.: Improved upper and lower bound heuristics for degree anonymization in social networks. CoRR, abs/1402.6239 (2014)
Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Proc. SIGMOD 2008, pp. 93–106. ACM (2008)
Lu, X., Song, Y., Bressan, S.: Fast identity anonymization on graphs. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012, Part I. LNCS, vol. 7446, pp. 281–295. Springer, Heidelberg (2012)
Samarati, P.: Protecting respondents identities in microdata release. IEEE Transactions on Knowledge and Data Engineering 13(6), 1010–1027 (2001)
Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information. In: Proc. PODS 1998, pp. 188–188. ACM (1998)
Sweeney, L.: k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10(5), 557–570 (2002)
Thompson, B., Yao, D.: The union-split algorithm and cluster-based anonymization of social networks. In: Proc. 4th ASIACCS 2009, pp. 218–227. ACM (2009)
Tripathi, A., Vijay, S.: A note on a theorem of Erdös & Gallai. Discrete Math. 265(1-3), 417–420 (2003)
Zhou, B., Pei, J.: The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowledge and Information Systems 28(1), 47–77 (2011)
Zhou, B., Pei, J., Luk, W.: A brief survey on anonymization techniques for privacy preserving publishing of social network data. ACM SIGKDD Explorations Newsletter 10(2), 12–22 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hartung, S., Hoffmann, C., Nichterlein, A. (2014). Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. In: Gudmundsson, J., Katajainen, J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham. https://doi.org/10.1007/978-3-319-07959-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-07959-2_32
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07958-5
Online ISBN: 978-3-319-07959-2
eBook Packages: Computer ScienceComputer Science (R0)