Authentication of k nearest neighbor queries in the presence of obstacles

Sharifa Tahmida Kaniz, Jibon Naher, T. Hashem
{"title":"Authentication of k nearest neighbor queries in the presence of obstacles","authors":"Sharifa Tahmida Kaniz, Jibon Naher, T. Hashem","doi":"10.1109/NSYSS2.2017.8267783","DOIUrl":null,"url":null,"abstract":"Recently, the widespread usage of smart phones and emergence of location based services (LBSs) have raised the necessity of data outsourcing paradigm. In this paradigm, a service provider (SP) offers services on the behalf of data owner (DO). However, the third party service provider may not be trustworthy. It may return incomplete or corrupted answers for personal benefits. Therefore, there must be a way to authenticate the answers returned by the SP. In this paper, we introduce an approach to authenticate an important class of LBSs, kNN queries in the obstructed space. A k nearest neighbor (kNN) query in the obstructed space enables a pedestrian to know k points of interest (POIs) such as restaurants or pharmacies that have k smallest distances from her current location considering the obstacles (e.g., buildings, lakes). Though authentication techniques of kNN queries exist for the Euclidean space and road networks, no work has been done to authenticate kNN queries in the obstructed space. We perform experiments using real datasets to show the effectiveness of our approach.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 4th International Conference on Networking, Systems and Security (NSysS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSYSS2.2017.8267783","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recently, the widespread usage of smart phones and emergence of location based services (LBSs) have raised the necessity of data outsourcing paradigm. In this paradigm, a service provider (SP) offers services on the behalf of data owner (DO). However, the third party service provider may not be trustworthy. It may return incomplete or corrupted answers for personal benefits. Therefore, there must be a way to authenticate the answers returned by the SP. In this paper, we introduce an approach to authenticate an important class of LBSs, kNN queries in the obstructed space. A k nearest neighbor (kNN) query in the obstructed space enables a pedestrian to know k points of interest (POIs) such as restaurants or pharmacies that have k smallest distances from her current location considering the obstacles (e.g., buildings, lakes). Though authentication techniques of kNN queries exist for the Euclidean space and road networks, no work has been done to authenticate kNN queries in the obstructed space. We perform experiments using real datasets to show the effectiveness of our approach.
在存在障碍物的情况下验证k个最近邻查询
近年来,智能手机的广泛使用和基于位置的服务(lbs)的出现提高了数据外包模式的必要性。在此范例中,服务提供者(SP)代表数据所有者(DO)提供服务。但是,第三方服务提供商可能不值得信任。它可能为个人利益返回不完整或损坏的答案。因此,必须有一种方法来验证SP返回的答案。在本文中,我们介绍了一种方法来验证一类重要的lbs,即阻塞空间中的kNN查询。在受阻的空间中,k个最近邻居(kNN)查询使行人能够知道k个兴趣点(poi),例如餐馆或药店,考虑到障碍物(例如,建筑物,湖泊),它们距离她当前位置的距离最小。虽然存在针对欧几里得空间和道路网络的kNN查询的身份验证技术,但尚未对阻塞空间中的kNN查询进行身份验证。我们使用真实数据集进行实验,以证明我们的方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信