{"title":"论k-匿名中敏感属性的多样性","authors":"Min Wu, Xiaojun Ye","doi":"10.1109/WI-IATW.2006.135","DOIUrl":null,"url":null,"abstract":"Privacy preservation is an important and challenging problem in microdata release. As a de-identification model, k-anonymity has gained much attention recently. While focusing on identity disclosures, k-anonymity does not well resolve attribute disclosures. In this paper we focus on the sensitive attribute disclosures in k-anonymity and propose an ordinal distance based sensitivity aware diversity metric. We assume the more diversity the sensitive attribute assumes in an equivalence class in a k-anonymized table, the less inference channel there is in the equivalence class","PeriodicalId":358971,"journal":{"name":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Towards the Diversity of Sensitive Attributes in k-Anonymity\",\"authors\":\"Min Wu, Xiaojun Ye\",\"doi\":\"10.1109/WI-IATW.2006.135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Privacy preservation is an important and challenging problem in microdata release. As a de-identification model, k-anonymity has gained much attention recently. While focusing on identity disclosures, k-anonymity does not well resolve attribute disclosures. In this paper we focus on the sensitive attribute disclosures in k-anonymity and propose an ordinal distance based sensitivity aware diversity metric. We assume the more diversity the sensitive attribute assumes in an equivalence class in a k-anonymized table, the less inference channel there is in the equivalence class\",\"PeriodicalId\":358971,\"journal\":{\"name\":\"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI-IATW.2006.135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IATW.2006.135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Towards the Diversity of Sensitive Attributes in k-Anonymity
Privacy preservation is an important and challenging problem in microdata release. As a de-identification model, k-anonymity has gained much attention recently. While focusing on identity disclosures, k-anonymity does not well resolve attribute disclosures. In this paper we focus on the sensitive attribute disclosures in k-anonymity and propose an ordinal distance based sensitivity aware diversity metric. We assume the more diversity the sensitive attribute assumes in an equivalence class in a k-anonymized table, the less inference channel there is in the equivalence class