Abstract
Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on randomization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in order to obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.
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.
References
Sweeney, L.: k-anonymity: a model for protecting privacy. Of Uncertainty Fuzziness and Knowledge Based 10(5), 557–570 (2002)
Hay, M., Miklau, G., Jensen, D., Weis, P., Srivastava, S.: Anonymizing Social Networks. Science, 1–17 (2007)
Ying, X., Pan, K., Wu, X., Guo, L.: Comparisons of randomization and k-degree anonymization schemes for privacy preserving social network publishing. In: The 3rd Workshop on Social Network, pp. 10:1–10:10. ACM, New York (2009)
Liu, K.: Towards identity anonymization on graphs. In: Proceedings of the 2008 ACM SIGMOD International, pp. 93–106. ACM, New York (2008)
Hay, M., Miklau, G., Jensen, D., Towsley, D., Weis, P.: Resisting structural re-identification in anonymized social networks. Proc. VLDB Endow. 1(1), 102–114 (2008)
Zou, L., Chen, L., Ozsu, M.T., A-zsu, M.T.: K-Automorphism: A General Framework For Privacy Preserving Network Publication. In: VLDB 2009: Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol. 2, pp. 946–957. VLDB Endowment, Lyon (2009)
Zachary, W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99(12), 7821–7826 (2002)
Gleiser, P., Danon, L.: Adv. Complex Syst. 6, 565 (2003)
Casas-Roma, J., Herrera-Joancomartí, J., Torra, V.: Algoritmos genéticos para la anonimización de grafos. In: XII Spanish Meeting on Cryptology and Information Security (RECSI), Donostia-San Sebastián, Spain (2012)
Torra, V., Narukawa, Y.: Modeling decisions: information fusion and aggregation operators. Springer (2007)
Das, S., Egecioglu, A., Abbadi, A.E.: Anonymizing weighted social network graphs. In: ICDE, pp. 904–907. IEEE (2010)
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
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Casas-Roma, J., Herrera-Joancomartí, J., Torra, V. (2012). Comparing Random-Based and k-Anonymity-Based Algorithms for Graph Anonymization. In: Torra, V., Narukawa, Y., López, B., Villaret, M. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2012. Lecture Notes in Computer Science(), vol 7647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34620-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-34620-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34619-4
Online ISBN: 978-3-642-34620-0
eBook Packages: Computer ScienceComputer Science (R0)