Abstract
In this paper, we propose a randomization scheme, LORA (Link Obfuscation by Randomization), to obfuscate edge existence in graphs. Specifically, we extract the source graph’s hierarchical random graph model and reconstruct the released graph randomly with this model. We show that the released graph can preserve critical graph statistical properties even after a large number of edges have been replaced. To measure the effectiveness of our scheme, we introduce the notion of link entropy to quantify its privacy-preserving strength wrt the existence of edges.
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
Bonchi, F., Gionis, A., Tassa, T.: Identity Obfuscation in Graphs Through the Information Theoretic Lens. In: IEEE International Conference on Data Engineering, pp. 924–935. IEEE Press, Hannover (2011)
Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature 453, 98–101 (2008)
Hay, M., Miklau, G., Jensen, D., Weis, P., Srivastava, S.: Anonymizing social networks. University of Massachusetts Technical Report (2007)
Ying, X., Wu, X.: Randomizing social networks: A spectrum preserving approach. In: Proceedings of the 8th SIAM Conference on Data Mining, pp. 739–750 (2008)
Ying, X., Wu, X.: Graph generation with prescribed feature constraints. In: Proceedings of the 9th SIAM Conference on Data Mining, pp. 966–977 (2009)
Hanhijarvi, S., Garriga, G.C., Puolamaki, K.: Randomization techniques for graphs. In: Proceedings of the 9th SIAM Conference on Data Mining, pp. 780–791 (2009)
Zou, L., Chen, L., Ozsu, M.T.: K-automorphism: A general framework for privacy preserving network publication. VLDB, 946–957 (2009)
Wu, W., Xiao, Y., Wang, W., He, Z., Wang, Z.: k-symmetry model for identity anonymization in social networks. EDBT, 111–122 (2010)
Cheng, J., Fu, A.W.C., Liu, J.: K-isomorphism: privacy preserving network publication against structural attacks. SIGMOD, 459–470 (2010)
Liu, K., Terzi, E.: Towards identity anonymization on graphs. SIGMOD, 93–106 (2008)
Clauset, A., Moore, C., Newman, M.E.J.: Structural Inference of Hierarchies in Networks. CoRR, 1–13 (2006)
Mir, D.J., Wright, R.N.: A Differentially Private Graph Estimator. In: ICDM Worshops, pp. 122–129 (2009)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. EÂ 74, 036104 (2006)
White, J.G., Southgate, E., Thomson, J.N., Brenner, S.: The Structure of the Nervous System of the Nematode Caenorhabditis elegans. Phil. Trans. R. Soc. London 314, 1–340 (1986)
Dam, E.R.V., Haemers, W.H.: Spectral Characterizations of Some Distance-Regular Graphs. Journal of Algebraic Combinatorics, 189–202 (2002)
Zhou, B., Pei, J.: Preserving Privacy in Social Networks Against Neighborhood Attacks. ICDE, 506–515 (2008)
Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th International Conference on World Wide Web, pp. 181–190 (2007)
Hay, M., Miklau, G., Jensen, D., Towsley, D., Weis, P.: Resisting structural re-identification in anonymized social networks. In: Proceedings of the VLDB Endowment, pp. 102–114 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, Q., Wang, Z., Tan, KL. (2011). LORA: Link Obfuscation by Randomization in Graphs. In: Jonker, W., Petković, M. (eds) Secure Data Management. SDM 2011. Lecture Notes in Computer Science, vol 6933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23556-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-23556-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23555-9
Online ISBN: 978-3-642-23556-6
eBook Packages: Computer ScienceComputer Science (R0)