Yet another privacy metric for publishing micro-data

Keith B. Frikken, Yihua Zhang
{"title":"Yet another privacy metric for publishing micro-data","authors":"Keith B. Frikken, Yihua Zhang","doi":"10.1145/1456403.1456423","DOIUrl":null,"url":null,"abstract":"Recently many schemes, including <i>k</i>-anonymity [8], <i>l</i>-diversity [6] and <i>t</i>-closeness [5] have been introduced for preserving individual privacy when publishing database tables. Furthermore <i>k</i>-anonymity and <i>l</i>-diversity have been shown to have weaknesses. In this paper, we show that <i>t</i>-closeness also has limitations, more specifically we argue that: i) choosing the correct value for <i>t</i> is difficult, ii) <i>t</i>-closeness does not allow some values of sensitive attributes to be more sensitive than other values, and iii) to prevent certain types of privacy leaks <i>t</i> must be set to such a small value that it produces low-quality published data. In this paper we propose a new privacy metric,(α<sub><i>i</i></sub>, β<sub><i>i</i></sub>)-closeness, that mitigates these problems. We also show how to calculate an optimal release table (in the full domain model) that satisfies (α<sub><i>i</i></sub>, β<sub><i>i</i></sub>)-closeness and we present experimental results that show that the data quality provided by 9α<sub><i>i</i></sub>, β;<sub><i>i</i></sub>),-closeness is higher than <i>t</i>-closeness, <i>k</i>-anonymity, and <i>l</i>-diversity while achieving the same privacy goals.","PeriodicalId":74537,"journal":{"name":"Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society","volume":"94 1","pages":"117-122"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM Workshop on Privacy in the Electronic Society. ACM Workshop on Privacy in the Electronic Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1456403.1456423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Recently many schemes, including k-anonymity [8], l-diversity [6] and t-closeness [5] have been introduced for preserving individual privacy when publishing database tables. Furthermore k-anonymity and l-diversity have been shown to have weaknesses. In this paper, we show that t-closeness also has limitations, more specifically we argue that: i) choosing the correct value for t is difficult, ii) t-closeness does not allow some values of sensitive attributes to be more sensitive than other values, and iii) to prevent certain types of privacy leaks t must be set to such a small value that it produces low-quality published data. In this paper we propose a new privacy metric,(αi, βi)-closeness, that mitigates these problems. We also show how to calculate an optimal release table (in the full domain model) that satisfies (αi, βi)-closeness and we present experimental results that show that the data quality provided by 9αi, β;i),-closeness is higher than t-closeness, k-anonymity, and l-diversity while achieving the same privacy goals.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
这是发布微数据的另一个隐私度量标准
近年来,为了保护数据库表发布时的个人隐私,提出了许多方案,包括k-匿名[8]、l-多样性[6]和t-封闭性[5]。此外,k-匿名性和l-多样性也有弱点。在本文中,我们证明了t-close也有局限性,更具体地说,我们认为:i)为t选择正确的值是困难的,ii) t-close不允许某些敏感属性的值比其他值更敏感,iii)为了防止某些类型的隐私泄露,必须将t设置为如此小的值,从而产生低质量的发布数据。在本文中,我们提出了一个新的隐私度量(αi, βi)-亲密度,以缓解这些问题。我们还展示了如何计算满足(αi, βi)-亲密度的最优发布表(在全域模型中),我们给出的实验结果表明,在实现相同隐私目标的情况下,由9αi, β;i),-亲密度提供的数据质量高于t-亲密度,k-匿名性和l-多样性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Study of Users' Privacy Preferences for Data Sharing on Symptoms-Tracking/Health App. Preserving Genomic Privacy via Selective Sharing. For human eyes only: security and usability evaluation Secure communication over diverse transports: [short paper] A machine learning solution to assess privacy policy completeness: (short paper)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1