The week's pick
Random Articles
Reseach Article
Enhancing the Utility of Generalization for Privacy Preserving Re-publication of Dynamic Datasets
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 13 - Number 6 |
| Year of Publication: 2011 |
| Authors: Leela Rani. P, Revathi.N |
10.5120/1781-2456
|
Leela Rani. P, Revathi.N . Enhancing the Utility of Generalization for Privacy Preserving Re-publication of Dynamic Datasets. International Journal of Computer Applications. 13, 6 ( January 2011), 42-49. DOI=10.5120/1781-2456
Abstract
Anonymized publication on static micro data can be achieved with heavy information loss by Generalization. An enhanced utility of Generalization known as Angelization produces the same level of anonymization but with minimal information loss. In reality, there may be a need to publish another version of micro data, after insertions and deletions. Anonymization is applicable to any generalization principles like k-Anonymity, l-diversity and t-closeness. Incremental m-invariance with Angelization preserves privacy in re-publication of dynamic micro data after insertions and deletions. Mondrian algorithm is used for the partitioning in Angelization. m-invariance also supports publication of marginals from the generalized micro data. KL-divergence is employed for quantifying the discrepancy of two distributions. The reconstruction error will be measured as the KL-divergence between the reconstructed distribution and the original distribution. Data reconstruction error is minimal in m-invariance with enhanced utility of Generalization.
References
- C.C. Aggarwal 2005. On K-Anonymity and the Curse of Dimensionality.Proc.Int’l.Conf.Very Large Data Bases (VLDB). pp.901-909.
- R. Bayardo and R. Agrawal 2005. Data Privacy through Optimal k-Anonymization. Proc. Int’l Conf. Data Eng. (ICDE). Pp. 217-218.
- G. Ghinita, P. Karras, P. Kalnis and N. Mamoulis 2007 Fast Data Anonymization with Low Information Loss. Proc. Int’l Conf. Very Large Data Bases (VLDB).pp. 758-769.
- K. LeFevre, D. J. Dewitt and R.Ramakrishnan. 2006. Mondrian Multidimensional k-Anonymity. Proc. Int’l Conf. Data Eng. (ICDE). pp.277-286.
- K. LeFevre, D. J. Dewitt and R.Ramakrishnan. 2005. Incognito:Efficient Full-Domain k-Anonymity. Proc. ACM SIGMOD Int’l Conf. Management of Data. pp. 49-60.
- N. Li, T. Li and S. Venkatasubramanian. 2007. t-closeness: Privacy beyond k-Anonymity and l-diversity. Proc. Int’l Conf Data Eng. (ICDE). pp. 106-115.
- A. Machanavajjhala, J. Gehrke, D. Kifer and M. Venkitasubramaniam. 2006. l-diversity:Privacy beyond k-Anonymity. Proc.Int’l Conf. Data Eng.(ICDE). pp. 24.
- H.Park and K.Shim. 2007. Approximate Algorithms for k-Anonymity. Proc. ACM SIGMOD Int’l Conf. Management of Data. Pp-67-78.
- V. Rastogi, S.Hong and D.Suciu. 2007. The Boundary between Privacy and Utility in Data Publishing. Proc. Int’l Conf. Very Large Data bases (VLDB) .pp. 531-542.
- P.Samarati. 2001.Protecting Respondents’ Identities in Micro data Release. IEEE Trans. Knowledge and Data Eng. Vol. 13.no. 6.pp. 1010-1027.
- L.Sweeny. 2002. K-Anonymity: A Model for protecting privacy. Int’l J. Uncertainty,Fuzziness and Kowledge-based Systems.vol.10.no.5. pp. 557-570.
- X. Xiao and Y. Tao. 2007. m-Invariance: Towards Privacy Preserving Re-Publication of Dynamic Data Sets. Proc. ACM SIGMOD Int’l Conf. Management of Data. pp. 689-700.
- C. Yao, X.S. Wang, and S. Jajodia 2005. Checking for k-Anonymity Violation by Views. Proc. Int’l Conf. Very Large Data Bases (VLDB), pp. 910-921.
- Yufei Tao, Hekang Chen, Xiaokui Xiao, Shuigeng Zhou, Member, IEEE Computer Society, and Donghui Zhang 2009, ANGEL: Enhancing the Utility of Generalization for Privacy Preserving Publication. IEEE Transaction on Knowledge and Data Engineering.Vol 21.No.7.pp.1073-1087.
Index Terms
Keywords