使用-privacy维护匿名性

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
D. Nussbaum, Masoud T. Omran, J. Sack
{"title":"使用-privacy维护匿名性","authors":"D. Nussbaum, Masoud T. Omran, J. Sack","doi":"10.1080/17489725.2017.1363419","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, we study potential inference attacks targeting location-based service (LBS) users. In particular, we introduce a new model for privacy protection, provides heuristic defence techniques to protect users’ privacy from such attacks, and present the results of experiments performed to evaluate the heuristics. Potential attackers who gain access to supplemental information may infer sensitive information such as location, identity or lifestyle about a user querying an LBS. Supplemental information used includes the times when queries are submitted, speed limits, and travel times for the underlying road network, or residential/commercial address directories. Our objective here is to prevent attackers from connecting external information to user queries. To address this objective, we introduce the notion of (i, j)-privacy. The novel (i, j)-privacy model generalises previous privacy models and allows users to customise their own privacy levels. To implement (i, j)-privacy, we have designed several heuristics. Although these are heuristic approaches, they do provide exact responses for user queries. We evaluate these heuristics experimentally on different road networks. We study the impact of a number of input parameters (mainly geometric) and present the results here. Our experiments demonstrate that, for realistic user settings, our algorithms provide results rapidly and of high quality.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2017-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17489725.2017.1363419","citationCount":"3","resultStr":"{\"title\":\"Maintaining anonymity using -privacy\",\"authors\":\"D. Nussbaum, Masoud T. Omran, J. Sack\",\"doi\":\"10.1080/17489725.2017.1363419\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper, we study potential inference attacks targeting location-based service (LBS) users. In particular, we introduce a new model for privacy protection, provides heuristic defence techniques to protect users’ privacy from such attacks, and present the results of experiments performed to evaluate the heuristics. Potential attackers who gain access to supplemental information may infer sensitive information such as location, identity or lifestyle about a user querying an LBS. Supplemental information used includes the times when queries are submitted, speed limits, and travel times for the underlying road network, or residential/commercial address directories. Our objective here is to prevent attackers from connecting external information to user queries. To address this objective, we introduce the notion of (i, j)-privacy. The novel (i, j)-privacy model generalises previous privacy models and allows users to customise their own privacy levels. To implement (i, j)-privacy, we have designed several heuristics. Although these are heuristic approaches, they do provide exact responses for user queries. We evaluate these heuristics experimentally on different road networks. We study the impact of a number of input parameters (mainly geometric) and present the results here. Our experiments demonstrate that, for realistic user settings, our algorithms provide results rapidly and of high quality.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2017-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/17489725.2017.1363419\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/17489725.2017.1363419\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17489725.2017.1363419","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 3

摘要

摘要在本文中,我们研究了针对基于位置服务(LBS)用户的潜在推理攻击。特别是,我们引入了一种新的隐私保护模型,提供了启发式防御技术来保护用户的隐私免受此类攻击,并给出了评估启发式的实验结果。访问补充信息的潜在攻击者可能会推断出有关用户查询LBS的位置、身份或生活方式等敏感信息。使用的补充信息包括提交查询的时间、速度限制、底层道路网络的行程时间或住宅/商业地址目录。我们的目标是防止攻击者将外部信息连接到用户查询。为了实现这一目标,我们引入了(i,j)-隐私的概念。新颖的(i,j)-隐私模型概括了以前的隐私模型,并允许用户自定义自己的隐私级别。为了实现(i,j)-隐私,我们设计了几个启发式算法。尽管这些都是启发式方法,但它们确实为用户查询提供了准确的响应。我们在不同的道路网络上对这些启发式方法进行了实验评估。我们研究了一些输入参数(主要是几何参数)的影响,并在这里给出了结果。我们的实验表明,对于真实的用户设置,我们的算法可以快速提供高质量的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Maintaining anonymity using -privacy
Abstract In this paper, we study potential inference attacks targeting location-based service (LBS) users. In particular, we introduce a new model for privacy protection, provides heuristic defence techniques to protect users’ privacy from such attacks, and present the results of experiments performed to evaluate the heuristics. Potential attackers who gain access to supplemental information may infer sensitive information such as location, identity or lifestyle about a user querying an LBS. Supplemental information used includes the times when queries are submitted, speed limits, and travel times for the underlying road network, or residential/commercial address directories. Our objective here is to prevent attackers from connecting external information to user queries. To address this objective, we introduce the notion of (i, j)-privacy. The novel (i, j)-privacy model generalises previous privacy models and allows users to customise their own privacy levels. To implement (i, j)-privacy, we have designed several heuristics. Although these are heuristic approaches, they do provide exact responses for user queries. We evaluate these heuristics experimentally on different road networks. We study the impact of a number of input parameters (mainly geometric) and present the results here. Our experiments demonstrate that, for realistic user settings, our algorithms provide results rapidly and of high quality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信