{"title":"Anonymization technique through record elimination to preserve privacy of published data","authors":"R. Mahesh, T. Meyyappan","doi":"10.1109/ICPRIME.2013.6496495","DOIUrl":null,"url":null,"abstract":"The term Data Privacy is associated with data collection and dissemination of data. Privacy issues arise in various area such as health care, intellectual property, biological data etc. It is one of the challenging issues when sharing or publishing the data between one to many sources for research purpose and data analysis. Sensitive information of data owners must be protected. There are two kinds of major attacks against privacy namely record linkage and attribute linkage attacks Earlier, researchers have proposed new methods namely k-anonymity, l-dlverslty, t-closeness for data privacy. K-anonymity method preserves the privacy against record linkage attack alone. It fails to address attribute linkage attack. l-diversity method overcomes the drawback of k-anonymity method. But it fails to address identity disclosure attack and attribute disclosure attack in some exceptional cases. t-closeness method preserves the privacy against attribute linkage attack but not identity disclosure attack. But it computational complexity is large. In this paper, the authors propose a new method to preserve the privacy of individuals' sensitive data from record and attribute linkage attacks. In the proposed method, privacy preservation is achieved through generalization of quasi identifier by setting range values and record elimination. The proposed method is implemented and tested with various data sets.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPRIME.2013.6496495","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 40
Abstract
The term Data Privacy is associated with data collection and dissemination of data. Privacy issues arise in various area such as health care, intellectual property, biological data etc. It is one of the challenging issues when sharing or publishing the data between one to many sources for research purpose and data analysis. Sensitive information of data owners must be protected. There are two kinds of major attacks against privacy namely record linkage and attribute linkage attacks Earlier, researchers have proposed new methods namely k-anonymity, l-dlverslty, t-closeness for data privacy. K-anonymity method preserves the privacy against record linkage attack alone. It fails to address attribute linkage attack. l-diversity method overcomes the drawback of k-anonymity method. But it fails to address identity disclosure attack and attribute disclosure attack in some exceptional cases. t-closeness method preserves the privacy against attribute linkage attack but not identity disclosure attack. But it computational complexity is large. In this paper, the authors propose a new method to preserve the privacy of individuals' sensitive data from record and attribute linkage attacks. In the proposed method, privacy preservation is achieved through generalization of quasi identifier by setting range values and record elimination. The proposed method is implemented and tested with various data sets.