A Study of Privacy Preserving Using Anonymization Techniques
Author : S. RenukaVolume 8 No.2 Special Issue:March 2019 pp 31-34
Abstract
Now a day’s there is an extensive use of technology that has led to a massive increase in the amount of data that is generated. The analysis of such information will help the business and organization in various ways and also contributing beneficially to society in many different fields. As this data also contains the considerable amount of user-sensitive and private information, it will lead to the potential threats to the user’s privacy if the data is published without applying any privacy preserving techniques to the data. This paper discusses the various anonymization techniques such as generalization and suppression which are used to preserve privacy during data publishing.
Keywords
Privacy, Anonymization, Suppression, Generalization, K-Anonymity
Full Text:
References
[1] D. Agrawal and C.C. Aggrawal, “On the design and quantification of privacy preserving data algorithm,” In proceedings of the twentieth ACM PUDS, 2001.
[2] M. Kantarcioglau, J. Jin, and C. Clito, “When do data mining result violate privacy?” In proceeding of the tenth ACN SIGKDD 2004.
[3] B. Fung, K. Wang, R. chen, and P.S Yu, “Privacy preserve data publishing: A Survey of recent development,” ACM computer survey (CSUR), Vol. 42, No. 4, pp. 14, 2010.
[4] A. Meyerson and R. Williams, “On the Complexity of Optimal k-anonymity,” In proceeding of twenty-third ACM SIGMOD-SIGACT-SIGART symposium on principles of database system, pp. 223-228, ACM, 2004.
[5] Disha Dubli and D.K. Yadavi, “Secure Techniques of Data Anonymization for Privacy Preservation,” International Journal of Advanced Research in Computer Science, Vol. 8, No. 5, May-June. 2017.
[6] L. Sweeney, “Achieving k-anonymity privacy protection using generalization and suppression,” International Journal of Uncertainty, Fuzziness and Knowledge-Based System Vol. 10, No. 05, pp. 571-588, 2002.
[7] J. Goldberger and T. Tassa, “Efficient anonymizations with enhanced utility,” In Data mining workshops, 2009. ICDMW’09. IEEE international conference on IEEE, pp. 106-113, 2009.
[8] Kinjal Parmar and Vinita Shah, “A Review on Data Anonymization in Privacy Preserving Data Mining,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE) Vol. 5, No. 2, February. 2016.
[9] D. Samarati and L. Sweeney, “Protecting privacy when disclosing information: Anonymity and its enforcement through generalization and suppression,” SRI International, SRI-CSL-98-04, 1998.
[10] L. Sweeney, “Achieving k-anonymity Privacy Protection using generalization and suppression, “International Journal of Uncertainty, Fuzziness and Knowledge-based system, Vol. 10, No. 05, pp. 571-588, 2002.
[11] S.K. Adusumalli and V.V. Kumari, “Attribute based anonymity for preserving privacy,” In Advances in Computing and Communications, pp. 572-579, Springer, 2011.
[12] B. Bercic and C. George, “Identifying Personal Data Using Relational Database Design Principles,” International Journal of Law and Information Technology, Vol. 17, No. 3, pp. 233-251, 2009.
[13] K. El Emam, F.K. Dankar, R. Issa, E. Jonker, D. Amyot, E. cogo, J.P. Corrivean, M. Walker, S. Chowdhway, R. vaillancourt, et al., “A Globally Optimal K-anonymity method for the de-identification of health data,” Journal of the American medical informatics Association, Vol.16, No.5, pp.670-682, 2009.
[14] E. Bertino, and R. Sandhu, “Database security – Concepts, approaches and challenges”, IEEE Transactions on Dependable and Secure Computing, Vol. 2, No.1, pp. 2–19, 2005
[15] M. Reed, P. Syverson, and D. Goldschlag, “Anonymous connections and Onion routing”, IEEE Journal of Selected Areas in Communications, Vol. 16, No.4, pp. 482–494, 1998
[16] M.K. Reiter, and A. Rubin, “Crowds: anonymity with Web transactions”, ACM Transactions on Information and System Security (TISSEC), Vol.1, No.1, pp.66–92, 1998.