|Table of Contents|

Algorithm for privacy preserving relational data publication based on hybrid partitioning approach

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2013年04期
Page:
493-
Research Field:
Publishing date:

Info

Title:
Algorithm for privacy preserving relational data publication based on hybrid partitioning approach
Author(s):
Wang YileiWu YingjieTang Qingming
College of Mathematics and Computer Science,Fuzhou University,Fuzhou 350108,China
Keywords:
privacy preservation relational data publication anonymous algorithm hybrid partitioning data quality
PACS:
TP311
DOI:
-
Abstract:
To increase the released data quality while assuring the privacy security,this paper proposes a space hybrid partitioning approach for privacy preserving relational data publication.After further research and analysis on privacy preserving relational data publication based on strict and non-strict space partitioning.This paper finds that the information loss of the released data produced by strict partitioning is higher than the information loss of the released data produced by non-strict partitioning,while some query confusion may occur in the released data by non-strict partitioning,thus leading to higher data quality of the release data produced by strict partitioning than by non-strict partitioning.In this paper,a hybrid partitioning approach for privacy preserving relational data publication,which combines the advantages of strict partitioning and non-strict partitioning,is presented.Experimental analysis is designed by comparing the algorithm proposed here and the traditional algorithms on the released data availability and the algorithm efficiency.Experimental results show that the proposed algorithm is effective and feasible.

References:

[1] Samarati P.Protecting respondent's identities in microdata release[J].IEEE Transactions on Knowledge and Data Engineering,2001,13(6):1010-1027.
[2]Sweeney L.K-anonymity:A model for protecting privacy[J].International Journal on Uncertainty,Fuzziness and Knowledge-based Systems,2002,10(5):557-570.
[3]Pinkas B.Cryptographic techniques for privacy preserving data mining[J].ACM SIGKDD Explorations,2002,4(2):12-19.
[4]Xiao Xiaokui,Tao Yufei.Anatomy:simple and effective privacy preservation[A].Proceedings of the 32nd International Conference on Very Large Database[C].New York,USA:ACM Press,2006:139-150.
[5]周水庚,李丰,陶宇飞,等.面向数据库应用的隐私保护研究综述[J].计算机学报,2009,32(5):847-858.
Zhou Shuigeng,Li Feng,Tao Yufei,et al.Privacy preservation in database applications:A survey[J].Chinese Journal of Computers,2009,32(5):847-858.
[6]Fung B C M,Wang Ke,Chen Rui,et al.Privacy-preserving data publishing:A survey on recent developments[J].ACM Computing Surveys,2010,42(4):1-53.
[7]Hore B,Jammalamadaka R,Mehrotra S.Flexible anonymization for privacy preserving data publishing:A systematic search based approach[A].Proceedings of the 2007 SIAM International Conference on Data Mining[C].Philadelphia,USA:Society for Industrial and Applied Mathematics,2007:497-502.
[8]Bayardo R,Agrawal R.Data privacy through optimal k-anonymization[A].Proceedings of the 21st International Conference on Data Engineering[C].Washington,USA:IEEE Computer Society,2005:217-228.
[9]LeFevre K,De Witt D,Ramakrishnan R.Mondrian multidimensional k-anonymity[A].Proceedings of the 22nd International Conference on Data Engineering[C].Washington,USA:IEEE Computer Society,2006:25-25.
[10]Xu Jian,Wang Wei,Pei Jian,et al.Utility-based anonymization using local recoding[A].Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].New York,USA:ACM Press,2006:785-790.
[11]吴英杰,唐庆明,倪巍伟,等.基于取整划分函数的k匿名算法[J].软件学报,2012,23(8):2138-2148.
Wu Yingjie,Tang Qingming,Ni Weiwei,et al.Algorithm for k-anonymity based on rounded partition function[J].Journal of Software,2012,23(8):2138-2148.
[12]Garey M R,Johnson D S.Computers and intractability:A guide to the theory of NP-Completeness[M].New York:W H Freeman and Company,1979.
[13]Iyengar V S.Transforming data to satisfy privacy constraints[A].Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].New York,USA:ACM Press,2002:279-288.
[14]吴英杰,王一蕾,唐庆明,等.一种基于子空间划分的最优k-匿名动态规划算法[J].小型微型计算机系统,2011,32(10):2002-2007.
Wu Yingjie,Wang Yilei,Tang Qingming,et al.A subspace partitioning based dynamic programming algorithm for optimal k-anonymization[J].Journal of Chinese Computer Systems,2011,32(10):2002-2007.
[15]Asuncion A,Newman D J.UCI machine learning reposi-tory[EB/OL].http://mlearn.ics.uci.edu/MLRepository.html,2007.

Memo

Memo:
-
Last Update: 2013-08-31