解决差分隐私中属性链接攻击的拓扑理论方法

Jincheng Wang, Zhuohua Li, John C.S. Lui, Mingshen Sun
{"title":"解决差分隐私中属性链接攻击的拓扑理论方法","authors":"Jincheng Wang, Zhuohua Li, John C.S. Lui, Mingshen Sun","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484499","DOIUrl":null,"url":null,"abstract":"Differential Privacy (DP) is well-known for its strong privacy guarantee. In this paper, we show that when there are correlations among attributes in the dataset, only relying on DP is not sufficient to defend against the \"attribute linkage attack\", which is a well-known privacy attack aiming at deducing participant’s attribute information. Our contributions are ① we show that the attribute linkage attack can be initiated with high probability even when data are protected under DP, ② we propose an enhanced DP standard called \"APL-Free ϵ-DP\", ③ by leveraging on topology theory, we design an algorithm \"APLKiller\" which satisfies this standard. Finally, experiments show that our algorithm not only eliminates the attribute linkage attack, but also achieves better data utility.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"402 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Topology-Theoretic Approach To Address Attribute Linkage Attacks In Differential Privacy\",\"authors\":\"Jincheng Wang, Zhuohua Li, John C.S. Lui, Mingshen Sun\",\"doi\":\"10.1109/INFOCOMWKSHPS51825.2021.9484499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Differential Privacy (DP) is well-known for its strong privacy guarantee. In this paper, we show that when there are correlations among attributes in the dataset, only relying on DP is not sufficient to defend against the \\\"attribute linkage attack\\\", which is a well-known privacy attack aiming at deducing participant’s attribute information. Our contributions are ① we show that the attribute linkage attack can be initiated with high probability even when data are protected under DP, ② we propose an enhanced DP standard called \\\"APL-Free ϵ-DP\\\", ③ by leveraging on topology theory, we design an algorithm \\\"APLKiller\\\" which satisfies this standard. Finally, experiments show that our algorithm not only eliminates the attribute linkage attack, but also achieves better data utility.\",\"PeriodicalId\":109588,\"journal\":{\"name\":\"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"402 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

差分隐私(DP)以其强大的隐私保障而闻名。在本文中,我们证明了当数据集中的属性之间存在相关性时,仅依靠DP不足以防御“属性链接攻击”,这是一种众所周知的隐私攻击,旨在推断参与者的属性信息。我们的贡献有:①我们证明了即使在DP下保护数据也可以高概率地发起属性链接攻击;②我们提出了一个增强的DP标准,称为“apl -自由ϵ-DP”;③利用拓扑理论,我们设计了一个满足该标准的算法“APLKiller”。最后,实验表明,该算法不仅消除了属性联动攻击,而且取得了较好的数据效用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Topology-Theoretic Approach To Address Attribute Linkage Attacks In Differential Privacy
Differential Privacy (DP) is well-known for its strong privacy guarantee. In this paper, we show that when there are correlations among attributes in the dataset, only relying on DP is not sufficient to defend against the "attribute linkage attack", which is a well-known privacy attack aiming at deducing participant’s attribute information. Our contributions are ① we show that the attribute linkage attack can be initiated with high probability even when data are protected under DP, ② we propose an enhanced DP standard called "APL-Free ϵ-DP", ③ by leveraging on topology theory, we design an algorithm "APLKiller" which satisfies this standard. Finally, experiments show that our algorithm not only eliminates the attribute linkage attack, but also achieves better data utility.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信