Slicing+: An Efficient Privacy Preserving Data Publishing
Objectives: Privacy and accuracy are always trade off factors in the field of data publishing. Ideally both the factors are considered critical for data handling. Privacy loss and accuracy loss need to be maintained low as possible for an efficient data handling system. Authors have come up with various data publishing techniques aiming to achieve balance between these 2 factors. Generalization, Bucketization and Slicing are well known techniques among the list. Unfortunately they have their own limitation in handling privacy and accuracy. Generalization suffers in handling high dimensional data thus experiencing higher utility loss. Bucketization lacks data privacy where parting sensitive and quasi identifier attributes is a challenge. Slicing on the other hand though offers better privacy and accuracy, there is always scope to improve data correlation aiming in reducing utility loss. This paper explains a new technique called Slicing+ which handles privacy and accuracy factors effectively. This new slicing+ technique looks promising as it offers flexibility for data publisher to decide on how the data need to published. Data publisher can tune the Slicing+ technique to get data published with better privacy than accuracy or the other way. Algorithms for the two cases are derived and realized usingORANGE tool. This paper explains analysis done for the first bucket tuples. As an improvement aspect, similar analysis can be done for other buckets and all the bucket tuples merged and reconstructed for complete analysis. This analysis is applied in the medical records. This hybrid slicing technique is rated against Privacy loss and Utility gain factors. Experimental results are analyzed to justify the performance of Slicing+ technique.
- Balakrishnan V, Shakouri MR, Hoodeh H. Integrating association rules to predict retinopathy. Maejo International Journal of Science and Technology. 2012 Sep: 6(03):334–43.
- Samarati P. Protecting respondent’s privacy in microdata release. IEEE Trans Knowledge and Data Eng. 2001 Nov; 13(6):1010–27.
- Sweeney L. k-Anonymity: A model for protecting privacy. Int’l J Knowledge-Based Systems. 2002 Oct; 10(5):557–70.
- Xiao X, Tao Y. Anatomy: Simple and effective privacy preservation. Proc Int’l Conf Very Large Data Bases; 2006 Sep. p. 139–50.
- Martin DJ, Halpern JY. Worst-case background knowledge for data publishing. Int’l Conf Data Eng; 2007 May. p. 126– 35.
- Koudas N, Yu T, Zhang Q. Aggregate query answering on anonymized tables. Int’l Conf Data Eng; Istanbul. 2007 Apr 15-20. p. 116–25.
- Brickell J, Shmatikov V. The cost of privacy: Destruction of data-mining utility in anonymized data publishing. KDD; 2008 Aug. p. 70–8.
- Li T, Li N. Tradeoff between privacy and utility in data publishing. Int’l Conf Knowledge Discovery and Mining; 2009 Jul. p. 517–26.
- Li T, Molloy I. Slicing: A new approach for privacy preserving data publishing. Trans on Knowledge and Data Eng. 2012 Mar; 24(3):561–74.
- Thummavet P, Vasupongayya S. Privacy-preserving emergency access control for health records. Maejo International Journal of Science and Technology. 2015 Apr; 9(01):108– 20.
- Aggarwa Cl. On k-Anonymity and the curse of dimensionality, Proc Int’l Conf Very Large Data Bases (VLDB); 2005 Aug. p. 901–9.
- Kifer D, Gehrke J. Injecting utility into anonymized data sets. Proc ACM Int’l Conf Management of Data; 2006 Jun. p. 217–28.
- Xiao X, Tao Y. Anatomy: Simple and effective privacy preservation. Proc Int’l Conf Very Large Data Bases; 2006. p. 139–50.
- Manikandan G, Sairam N, Sharmili S, Venkatakrishnan S. Achieving privacy in data mining using normalization. Indian Journal of Science and Technology. 2013 Apr; 6(4):1–5.
- Nergiz ME, Clifton C. Hiding the presence of individuals from shared databases. Int’l Conf Management of Data; 2007 Jun. p. 665–76.
- Machanavajjhala A, Venkitasubramaniam M. L‘-Diversity: Privacy beyond k-anonymity. Proc Int’l Conf Data Eng; Atlanta, GA. USA 2006 Apr 3-7. p. 24.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.