OKV: Optimized Key-Value Data Collection with Local Differential Privacy

Bowen Deng, Lele Zheng, Ze Tong, Jing Gao, Tao Zhang, Qi Li
{"title":"OKV: Optimized Key-Value Data Collection with Local Differential Privacy","authors":"Bowen Deng, Lele Zheng, Ze Tong, Jing Gao, Tao Zhang, Qi Li","doi":"10.1109/NaNA56854.2022.00078","DOIUrl":null,"url":null,"abstract":"Local differential privacy (LDP), where each user obfuscates their data locally before sending it to an untrustworthy data collector, provides a strict privacy guarantee for users' sensitive data. However, the existing key-value data collection mechanisms based on the LDP assume that all keys are equally sensitive, which leads to excessive protection and thus loss of utility. To address the reduced utility caused by overprotection, we introduce the notion of key-value data utility-optimized LDP (KV-ULDP), which only offers a basic LDP-equivalent privacy guarantee for sensitive keys and all values. Subsequently, we design a new framework, named optimized key-value data collection (OKV) with LDP, which satisfies the KV-ULDP with high utility while keeping secret for each user. We instantiate the OKV framework by using OKV-UE (based on Unary Encoding) and OKV-GRR (based on Generalized Randomized Response) mechanisms. The OKV-UE is effective with a large number of key types, and OKV-GRR works well under high privacy budgets. The theoretical analysis and the experiments on two real datasets show that our mechanisms outperform the existing key-value mechanisms with LDP in terms of utility.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA56854.2022.00078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Local differential privacy (LDP), where each user obfuscates their data locally before sending it to an untrustworthy data collector, provides a strict privacy guarantee for users' sensitive data. However, the existing key-value data collection mechanisms based on the LDP assume that all keys are equally sensitive, which leads to excessive protection and thus loss of utility. To address the reduced utility caused by overprotection, we introduce the notion of key-value data utility-optimized LDP (KV-ULDP), which only offers a basic LDP-equivalent privacy guarantee for sensitive keys and all values. Subsequently, we design a new framework, named optimized key-value data collection (OKV) with LDP, which satisfies the KV-ULDP with high utility while keeping secret for each user. We instantiate the OKV framework by using OKV-UE (based on Unary Encoding) and OKV-GRR (based on Generalized Randomized Response) mechanisms. The OKV-UE is effective with a large number of key types, and OKV-GRR works well under high privacy budgets. The theoretical analysis and the experiments on two real datasets show that our mechanisms outperform the existing key-value mechanisms with LDP in terms of utility.
OKV:具有本地差分隐私的优化键值数据收集
LDP (Local differential privacy)是指每个用户在将数据发送给不可信的数据采集器之前,先在本地对数据进行模糊处理,为用户的敏感数据提供严格的隐私保障。但是,现有的基于LDP的键值数据收集机制假设所有的键都是同样敏感的,这就导致了过度的保护,从而失去了效用。为了解决过度保护导致的效用降低问题,我们引入了键值数据效用优化LDP (KV-ULDP)的概念,它仅为敏感键和所有值提供基本的与LDP相当的隐私保证。在此基础上,我们设计了一个新的基于LDP的优化key-value data collection (OKV)框架,该框架既满足了LDP - uldp的高实用要求,又为每个用户保密。我们使用OKV- ue(基于一元编码)和OKV- grr(基于广义随机响应)机制实例化了OKV框架。OKV-UE对大量密钥类型有效,OKV-GRR在高隐私预算下也能很好地工作。理论分析和在两个真实数据集上的实验表明,我们的机制在效用方面优于现有的带有LDP的键值机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信