Advertisement

Towards Identity Disclosure Control in Private Hypergraph Publishing

  • Yidong Li
  • Hong Shen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7302)

Abstract

Identity disclosure control (IDC) on complex data has attracted increasing interest in security and database communities. Most existing work focuses on preventing identity disclosure in graphs that describes pairwise relations between data entities. Many data analysis applications need information about multi-relations among entities, which can be well represented with hypergraphs. However, the IDC problem has been little studied in publishing hypergraphs due to the diversity of hypergraph information which may expose to many types of background knowledge attacks. In this paper, we introduce a novel attack model with the properties of hyperedge rank as background knowledge, and formalize the rank-based hypergraph anonymization (RHA) problem. We propose an algorithm running in near-quadratic time on hypergraph size for rank anonymization which we show to be NP-hard, and in the meanwhile, maintaining data utility for community detection. We also show how to construct the hypergraph under the anonymized properties to protect a hypergraph from rank-based attacks. The performances of the methods have been validated by extensive experiments on real-world datasets. Our rank-based attack model and algorithms for rank anonymization and hypergraph construction are, to our best knowledge, the first systematic study for private hypergraph publishing.

Keywords

Identity disclosure control Private hypergraph publishing Anonymization Community detection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asuncion, A., Newman, D.J.: UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences (2010)Google Scholar
  2. 2.
    Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: WWW 2007: Proceedings of the 16th International Conference on World Wide Web, pp. 181–190. ACM, New York (2007)CrossRefGoogle Scholar
  3. 3.
    Domingo-ferrer, J.: Efficient multivariate data-oriented microaggregation. The VLDB Journal 15, 355–369 (2006)CrossRefGoogle Scholar
  4. 4.
    Erdos, P., Gallai, T.: Graphs with prescribed degrees of vertices. Mat. Lapok 11, 264–274 (1960)Google Scholar
  5. 5.
    Feder, T., Nabar, S.U., Terzi, E.: Anonymizing graphs (2008)Google Scholar
  6. 6.
    Ghoshal, G., Zlatiić, V., Caldarelli, G., Newman, M.E.J.: Random hypergraphs and their applications. Phys. Rev. E 79(6), 066118 (2009)CrossRefGoogle Scholar
  7. 7.
    Guimera, R., Sales-Pardo, M., Nunes Amaral, L.A.: Module identification in bipartite and directed networks. Physical Review E 76(036102) (2007)Google Scholar
  8. 8.
    Halbeisen, L., Hungerbuhler, N.: Reconstruction of weighted graphs by their spectrum. Eur. J. Comb. 21(5), 641–650 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Hay, M., Miklau, G., Jensen, D.: Anonymizing social networks. Technical Report 07-19, University of Massachusetts Amherst (March 2007)Google Scholar
  10. 10.
    Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD 2008: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 93–106. ACM, New York (2008)CrossRefGoogle Scholar
  11. 11.
    Liu, L., Wang, J., Liu, J., Zhang, J.: Privacy preservation in social networks with sensitive edge weights. In: 2009 SIAM International Conference on Data Mining (SDM 2009), Sparks, Nevada, pp. 954–965 (April 2009)Google Scholar
  12. 12.
    Egecioglu, O., Das, S., El Abbadi, A.: Anonymizing weighted social network graphs. In: The 26th International Conference on Data Engineering, ICDE 2010 (2010)Google Scholar
  13. 13.
    Vazquez, A.: Finding hypergraph communities: a bayesian approach and variational solution. Journal of Statistical Mechanics: Theory and Experiment (July 2009)Google Scholar
  14. 14.
    Ying, X., Wu, X.: Randomizing social networks: a spectrum preserving approach. In: SDM 2008: The SIAM International Conference on Data Mining, Atlanta, GA (April 2008)Google Scholar
  15. 15.
    Zheleva, E., Getoor, L.: Preserving the Privacy of Sensitive Relationships in Graph Data. In: Bonchi, F., Malin, B., Saygın, Y. (eds.) PInKDD 2007. LNCS, vol. 4890, pp. 153–171. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  16. 16.
    Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE 2008: The 24th International Conference on Data Engineering, pp. 506–515. IEEE Computer Society, Los Alamitos (2008)CrossRefGoogle Scholar
  17. 17.
    Zhou, D., Huang, J., Scholkopf, B.: Learning with hypergraphs: Clustering, classification, and embedding. Advances in Neural Information Processing Systems 19, 1601–1608 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yidong Li
    • 1
  • Hong Shen
    • 1
    • 2
  1. 1.School of Computer and Information TechnologyBeijing Jiaotong UniversityBeijingChina
  2. 2.School of Computer ScienceUniversity of AdelaideAustralia

Personalised recommendations