Loading...

(t,k)-Hypergraph anonymization: An approach for secure data publishing

Asayesh, A ; Sharif University of Technology | 2015

480 Viewed
  1. Type of Document: Article
  2. DOI: 10.1002/sec.1084
  3. Publisher: John Wiley and Sons Inc , 2015
  4. Abstract:
  5. Privacy preservation is an important issue in data publishing. Existing approaches on privacy-preserving data publishing rely on tabular anonymization techniques such as k-anonymity, which do not provide appropriate results for aggregate queries. The solutions based on graph anonymization have also been proposed for relational data to hide only bipartite relations. In this paper, we propose an approach for anonymizing multirelation constraints (ternary or more) with (t,k) hypergraph anonymization in data publishing. To this end, we model constraints as undirected hypergraphs and formally cluster attribute relations as hyperedge with the t-means-clustering algorithm. In addition, anonymization is carried out with a k-anonymity method in every cluster for which the parameter k can vary in each cluster, to attain more flexibility and less information loss with respect to utility. Our experiments demonstrate that this approach offers a great trade-off between privacy and utility
  6. Keywords:
  7. Privacy ; Clustering algorithms ; Economic and social effects ; Aggregate queries ; Anonymization ; Clustering ; Data publishing ; Hypergraph ; Model constraints ; Privacy preservation ; Privacy preserving ; Data privacy
  8. Source: Security and Communication Networks ; Volume 8, Issue 7 , September , 2015 , Pages 1306-1317 ; 19390114 (ISSN)
  9. URL: http://onlinelibrary.wiley.com/doi/10.1002/sec.1084/abstract;jsessionid=CC0F8CBCF1D4E59786211353113968E0.f04t02