Abstract
The goal of graph anonymization is avoiding disclosure of privacy in social networks through graph modifications meanwhile preserving data utility of anonymized graphs for social network analysis. Graph reachability is an important data utility as reachability queries are not only common on graph databases, but also serving as fundamental operations for many other graph queries. However, the graph reachability is severely distorted after anonymization. In this work, we study how to preserve the d-reachability of vertices when anonymizing social networks. We solve the problem by designing a d-reachability preserving graph anonymization (d-RPA for short) algorithm. The main idea of d-RPA is to find a subgraph that preserves the d-reachability, and keep it unchanged during anonymization. We show that d-RPA can efficiently find such a subgraph and anonymize the releasing graph with low information loss. Extensive experiments on real datasets illustrate that anonymized social networks generated by our method can be used to answer d-reachable queries with high accuracy.
The work is partially supported by the National Natural Science Foundation of China (Nos. 61502316, 61502317).
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
Notes
- 1.
Available at http://snap.stanford.edu/data/.
References
Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.: K-reach: who is in your small world. In: VLDB 2012 (2012)
Fard, A.M., Wang, K., Yu, P.S.: Limiting link disclosure in social network analysis through subgraph-wise perturbation. In: EDBT 2012 (2012)
Hay, M., Miklau, G., Jensen, D., Towsley, D., Weis, P.: Resisting structural re-identification in anonymized social networks. In: VLDB 2008, pp. 102–114 (2008)
Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-dimensional matching. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 83–97. Springer, Heidelberg (2003)
Karp, R.: Reducibility among combinatorial problems. In: Jünger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wosley, L.A. (eds.) 50 Years of Integer Programming 1958–2008, pp. 219–241. Springer, Heidelberg (2010)
Li, M., Gao, H., Zou, Z.: K-reach query processing based on graph compression. J. Softw. 25(4), 797–812 (2014)
Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD 2008, pp. 93–106 (2008)
Liu, X., Wang, B., Yang, X.: Efficiently anonymizing social networks with reachability preservation. In: CIKM 2013, pp. 1613–1618 (2013)
Liu, X., Yang, X.: Protecting sensitive relationships against inference attacks in social networks. In: Lee, S., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part I. LNCS, vol. 7238, pp. 335–350. Springer, Heidelberg (2012)
Ying, X., Wu, X.: Randomizing social networks: a spectrum preserving approach. In: SDM 2008, pp. 739–750 (2008)
Yuan, M., Chen, L., Yu, P.: Personalized privacy protection in social networks. In: VLDB 2010, pp. 141–150 (2010)
Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE 2008, pp. 506–515 (2008)
Zou, L., Chen, L., Özsu, M.: K-automorphism: a general framework for privacy preserving network publication. In: VLDB 2009, pp. 946–957 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, X., Li, J., Zhou, D., An, Y., Xia, X. (2016). Preserving the d-Reachability When Anonymizing Social Networks. In: Cui, B., Zhang, N., Xu, J., Lian, X., Liu, D. (eds) Web-Age Information Management. WAIM 2016. Lecture Notes in Computer Science(), vol 9659. Springer, Cham. https://doi.org/10.1007/978-3-319-39958-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-39958-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39957-7
Online ISBN: 978-3-319-39958-4
eBook Packages: Computer ScienceComputer Science (R0)