利用用户服务灵活性的多用户隐私合作博弈

Shu Hong, Lingjie Duan
{"title":"利用用户服务灵活性的多用户隐私合作博弈","authors":"Shu Hong, Lingjie Duan","doi":"10.1109/ISIT50566.2022.9834703","DOIUrl":null,"url":null,"abstract":"In location-based services (LBSs), it is promising for multiple users to cache and share their Point-of-Interest (PoI) information with each other to reduce overall query frequency and preserve location privacy. Yet most studies on multi-user privacy preservation overlook the opportunity of leveraging service flexibility, where many users are flexible and may add obfuscation to individual LBS query. This paper is the first to study how multiple users cooperate to query with obfuscation against the adversary’s optimal inference attack, by leveraging their mutual service flexibility. Unlike the literature, even if a user already finds the shared PoI information useful, we prove it beneficial for him to further query with obfuscated location to confuse the adversary. To save the computational complexity of the max-min adversarial game problem and derive the closed-form solution, we also propose a binary approximate solution, which is proved to guarantee good privacy performance for an average user. Perhaps surprisingly, the user with greater service flexibility should choose to query the LBS with less misreported location, to maximally confuse the adversary. Finally, we numerically compare our optimal and approximate solutions with the existing approaches to show our effective privacy improvement.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-user Privacy Cooperation Game by Leveraging Users’ Service Flexibility\",\"authors\":\"Shu Hong, Lingjie Duan\",\"doi\":\"10.1109/ISIT50566.2022.9834703\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In location-based services (LBSs), it is promising for multiple users to cache and share their Point-of-Interest (PoI) information with each other to reduce overall query frequency and preserve location privacy. Yet most studies on multi-user privacy preservation overlook the opportunity of leveraging service flexibility, where many users are flexible and may add obfuscation to individual LBS query. This paper is the first to study how multiple users cooperate to query with obfuscation against the adversary’s optimal inference attack, by leveraging their mutual service flexibility. Unlike the literature, even if a user already finds the shared PoI information useful, we prove it beneficial for him to further query with obfuscated location to confuse the adversary. To save the computational complexity of the max-min adversarial game problem and derive the closed-form solution, we also propose a binary approximate solution, which is proved to guarantee good privacy performance for an average user. Perhaps surprisingly, the user with greater service flexibility should choose to query the LBS with less misreported location, to maximally confuse the adversary. Finally, we numerically compare our optimal and approximate solutions with the existing approaches to show our effective privacy improvement.\",\"PeriodicalId\":348168,\"journal\":{\"name\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"108 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT50566.2022.9834703\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT50566.2022.9834703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在基于位置的服务(lbs)中,多个用户可以缓存并彼此共享他们的兴趣点(PoI)信息,以减少总体查询频率并保护位置隐私。然而,大多数关于多用户隐私保护的研究都忽略了利用服务灵活性的机会,因为许多用户都是灵活的,可能会给单个LBS查询增加混淆。本文首次研究了多用户如何利用其相互服务的灵活性,合作进行带有混淆的查询来对抗对手的最优推理攻击。与文献不同的是,即使用户已经发现共享的PoI信息很有用,我们也证明了使用模糊位置进行进一步查询以迷惑对手是有益的。为了节省最大最小对抗博弈问题的计算复杂度并推导出封闭形式的解,我们还提出了一个二进制近似解,并证明了该近似解可以保证普通用户的良好隐私性能。也许令人惊讶的是,具有更大服务灵活性的用户应该选择查询具有较少错误报告位置的LBS,以最大限度地迷惑对手。最后,我们将我们的最优解和近似解与现有方法进行数值比较,以表明我们有效地改善了隐私。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi-user Privacy Cooperation Game by Leveraging Users’ Service Flexibility
In location-based services (LBSs), it is promising for multiple users to cache and share their Point-of-Interest (PoI) information with each other to reduce overall query frequency and preserve location privacy. Yet most studies on multi-user privacy preservation overlook the opportunity of leveraging service flexibility, where many users are flexible and may add obfuscation to individual LBS query. This paper is the first to study how multiple users cooperate to query with obfuscation against the adversary’s optimal inference attack, by leveraging their mutual service flexibility. Unlike the literature, even if a user already finds the shared PoI information useful, we prove it beneficial for him to further query with obfuscated location to confuse the adversary. To save the computational complexity of the max-min adversarial game problem and derive the closed-form solution, we also propose a binary approximate solution, which is proved to guarantee good privacy performance for an average user. Perhaps surprisingly, the user with greater service flexibility should choose to query the LBS with less misreported location, to maximally confuse the adversary. Finally, we numerically compare our optimal and approximate solutions with the existing approaches to show our effective privacy improvement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast Low Rank column-wise Compressive Sensing Ternary Message Passing Decoding of RS-SPC Product Codes Understanding Deep Neural Networks Using Sliced Mutual Information Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network Unlimited Sampling via Generalized Thresholding
×
引用
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