A New K-NN Query Processing Algorithm Enhancing Privacy Protection in Location-Based Services

Miyoung Jang, Sung-Jae Jang, Jae-Woo Chang
{"title":"A New K-NN Query Processing Algorithm Enhancing Privacy Protection in Location-Based Services","authors":"Miyoung Jang, Sung-Jae Jang, Jae-Woo Chang","doi":"10.1109/MobServ.2012.24","DOIUrl":null,"url":null,"abstract":"Location-Based Services (LBSs) are becoming popular due to the advances in mobile networks and positioning capabilities. When a user sends a query with his exact location to the LBS server, the server processes the query and returns Points of Interest (POIs) to the user. Providing user's exact location to the LBS server may lead revealing his private information to unauthorized parties (e.g., adversaries). There exist two main fields of research to overcome this problem. They are cloaking region based query processing method which blurs a user's location into a cloaking region and Private Information Retrieval (PIR) based query processing methods which encrypt location data by using PIR protocol. However, they suffer from high computation and communication overheads. To resolve these problems, we, in this paper, propose a hybrid scheme to process an approximate k-Nearest Neighbor (k-NN) query by combining above two methods. Through performance analysis, we have shown that our hybrid scheme outperforms the existing work in terms of both query processing time and accuracy of the result set.","PeriodicalId":443858,"journal":{"name":"2012 IEEE First International Conference on Mobile Services","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE First International Conference on Mobile Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MobServ.2012.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Location-Based Services (LBSs) are becoming popular due to the advances in mobile networks and positioning capabilities. When a user sends a query with his exact location to the LBS server, the server processes the query and returns Points of Interest (POIs) to the user. Providing user's exact location to the LBS server may lead revealing his private information to unauthorized parties (e.g., adversaries). There exist two main fields of research to overcome this problem. They are cloaking region based query processing method which blurs a user's location into a cloaking region and Private Information Retrieval (PIR) based query processing methods which encrypt location data by using PIR protocol. However, they suffer from high computation and communication overheads. To resolve these problems, we, in this paper, propose a hybrid scheme to process an approximate k-Nearest Neighbor (k-NN) query by combining above two methods. Through performance analysis, we have shown that our hybrid scheme outperforms the existing work in terms of both query processing time and accuracy of the result set.
一种增强位置服务隐私保护的K-NN查询处理新算法
由于移动网络和定位能力的进步,基于位置的服务(lbs)正变得越来越流行。当用户向LBS服务器发送包含其确切位置的查询时,服务器将处理该查询并向用户返回兴趣点(poi)。向LBS服务器提供用户的确切位置可能会导致他的私人信息泄露给未经授权的各方(例如,对手)。目前有两个主要的研究领域来解决这个问题。它们是基于隐蔽区域的查询处理方法,该方法将用户的位置模糊到一个隐蔽区域;基于私有信息检索(PIR)的查询处理方法,该方法使用PIR协议对位置数据进行加密。然而,它们有很高的计算和通信开销。为了解决这些问题,本文提出了一种结合上述两种方法来处理近似k-最近邻(k-NN)查询的混合方案。通过性能分析,我们已经表明,我们的混合方案在查询处理时间和结果集的准确性方面都优于现有的工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信