Privacy Preserving Reverse k-Nearest Neighbor Queries

Layla Pournajaf, Farnaz Tahmasebian, Li Xiong, V. Sunderam, C. Shahabi
{"title":"Privacy Preserving Reverse k-Nearest Neighbor Queries","authors":"Layla Pournajaf, Farnaz Tahmasebian, Li Xiong, V. Sunderam, C. Shahabi","doi":"10.1109/MDM.2018.00035","DOIUrl":null,"url":null,"abstract":"Reverse k-nearest neighbor (RkNN) queries are prevalent in location-based services to find those locations that have the query point as one of their k nearest neighbors. However, such query requires users to disclose the location of the query point to a service provider who might be untrustworthy. Previous attempts to preserve the privacy of RkNN queries are either based on weaker notions of privacy such as location cloaking or not efficient when k > 1. In this paper, we propose novel solutions based on the private information retrieval (PIR) mechanism to preserve the privacy of RkNN query points. Our solutions include server-side data indexing and client-side query processing methods to facilitate PIR which is an inherently expensive data retrieval mechanism. We experimentally evaluate our approach using real-world datasets and show that it preserves the location privacy of queries with reasonable computation and storage overhead.","PeriodicalId":205319,"journal":{"name":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2018.00035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Reverse k-nearest neighbor (RkNN) queries are prevalent in location-based services to find those locations that have the query point as one of their k nearest neighbors. However, such query requires users to disclose the location of the query point to a service provider who might be untrustworthy. Previous attempts to preserve the privacy of RkNN queries are either based on weaker notions of privacy such as location cloaking or not efficient when k > 1. In this paper, we propose novel solutions based on the private information retrieval (PIR) mechanism to preserve the privacy of RkNN query points. Our solutions include server-side data indexing and client-side query processing methods to facilitate PIR which is an inherently expensive data retrieval mechanism. We experimentally evaluate our approach using real-world datasets and show that it preserves the location privacy of queries with reasonable computation and storage overhead.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
保护隐私的反向k近邻查询
反向k近邻查询(RkNN)在基于位置的服务中很流行,用于查找将查询点作为其k近邻之一的位置。然而,这样的查询要求用户将查询点的位置透露给可能不值得信任的服务提供者。以前保护RkNN查询隐私的尝试要么基于较弱的隐私概念,比如位置隐藏,要么在k > 1时效率不高。本文提出了一种基于私有信息检索(PIR)机制的RkNN查询点隐私保护方案。我们的解决方案包括服务器端数据索引和客户端查询处理方法,以促进PIR,这是一种本质上昂贵的数据检索机制。我们使用真实世界的数据集对我们的方法进行了实验评估,并表明它在合理的计算和存储开销下保留了查询的位置隐私。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FMS: Managing Crowdsourced Indoor Signals with the Fingerprint Management Studio Stochastic Shortest Path Finding in Path-Centric Uncertain Road Networks Concept for Evaluation of Techniques for Trajectory Distance Measures VIPTRA: Visualization and Interactive Processing on Big Trajectory Data DCount - A Probabilistic Algorithm for Accurately Disaggregating Building Occupant Counts into Room Counts
×
引用
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