Comparison of various Anonymization Technique
Keywords:
Anonymization, Generalization, Supperession, PrivacyAbstract
Cloud based service is in trend for storing the database. Thus, exposing the data of the individual to the outside world is at the risk. Our major concern is to maintain privacy so that the data of the individual is not exposed to the adversary. In this paper, various techniques, how they have implemented, its new ideas and the models in order to implement privacy have been discussed. Few such techniques discussed are k-anonymity, l-diversity, t-closeness, (X, Y) anonymity, δ-Presence. All these techniques have its own approaches to secure data but in future, further new approaches having less time and space complexity can be thought of.
References
JHS Tomar, JS Kumar, "A Review on Big Data Mining Methods", International Journal of Scientific Research in Network Security and Communication, Vol.4, Issue.3, pp.7-14, 2016.
X. Wu, X. Zhu, G. Q. Wu and W. Ding, "Data mining with big data," in IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 1, pp. 97-107, Jan. 2014.
H. Taneja, Kapil and A. K. Singh, “Preserving Privacy of Patients based on Re-identification Risk,” 4th International Conference on Eco-friendly Computing and Communication Systems (ICECCS), vol. 70, pp. 448-454, 2015,.
B. Zhou, J. Pei. And W. Luk,”A brief survey on anonymization technique for privacy preserving publishing of social network data,” ACM SIGKDD Explorations Newsletter, ACM New York, NY, USA, vol. 10, no. 2, pp. 12-22, Dec. 2008.
T. Li and N. Li, "Injector: Mining Background Knowledge for Data Anonymization," 2008 IEEE 24th International Conference on Data Engineering, Cancun, pp. 446-455, 2008.
R. Mahesh and T. Meyyappan, "Anonymization technique through record elimination to preserve privacy of published data," 2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering, Salem, pp. 328-332, 2013.
M. Balusamy and S. Muthusundari, "Data anonymization through generalization using map reduce on cloud," Proceedings of IEEE International Conference on Computer Communication and Systems ICCCS14, Chennai, pp. 039-042, 2014.
P. Deivanai, J. J. V. Nayahi and V. Kavitha, "A hybrid data anonymization integrated with suppression for preserving privacy in mining multi party data," 2011 International Conference on Recent Trends in Information Technology (ICRTIT), Chennai, Tamil Nadu, pp. 732-736, 2011.
L. Sweeney, “k-anonymity: A model for protecting privacy,” International journal on uncertainty, fuzziness and knowledge-based systems, vol. 10 no. 5, pp. 557-570, 2002.
A. Machanavajjhala, J. Gehrke, D. Kifer and M. Venkitasubramaniam, "L-diversity: privacy beyond k-anonymity," 22nd International Conference on Data Engineering (ICDE’06), Atlanta, GA, USA, pp. 24-24, 2006.
K. Wang and B. C. M. Fung, “Anonymizing Sequential Realease,” KDD’06, Philadellphia, Pennsylvania, USA, August 20-23, pp. 1-10, 2006.
N. Li, T. Li and S. Venkatasubramanian, "t-Closeness: Privacy Beyond k-Anonymity and l-Diversity," 2007 IEEE 23rd International Conference on Data Engineering, Istanbul, pp. 106-115, 2007.
K. LeFevre, D. J. DeWitt and R. Ramakrishnan, “Incognito: Efficient Full-Domain K-Anonimity,” Proc. 2005 ACM Sigmod Int. Conf. Management of data, Maryland, June14-16, pp. 49-60, 2005.
X. Xiao, K. Yi and Y. Tao, “The Hardness and approxiamation algorithm for l-diversity,” Proc. 13th Int. Conf. Extending Database Technology, Lausanne, Switzerland, March 22-26, pp. 135-146, 2010.
M. E. Nergiz and C. Clifton, "δ-Presence without Complete World Knowledge," in IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 6, pp. 868-883, June 2010.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
