首页> 外文会议>International conference on web information systems engineering >Evaluating k Nearest Neighbor Query on Road Networks with no Information Leakage
【24h】

Evaluating k Nearest Neighbor Query on Road Networks with no Information Leakage

机译:在没有信息泄露的道路网络上评估K最近邻查询

获取原文

摘要

The development of positioning technologies and pervasiveness of mobile devices make an upsurge of interest in location based services (LBS). The k nearest neighbor(kNN) query in road networks is an important query type in LBS and has many real life applications, such as map service. However, such query requires the client to disclose sensitive location information to the LBS. The only existing method for privacy-preserving kNN query adopts the cloaking-region paradigm, which blurs the location into a spatial region. However, the LBS can still deduce some information (albeit not exact) about the location. In this paper, we aim at strong privacy wherein the LBS learns nothing about the query location. To this end, we employ private information retrivial (PIR) technique, which accesses data pages anonymously from a database. Based on PIR, we propose a secure query processing framework together with flexible query plan for arbitrary kNN query. To the best of our knowledge, this is the first research that preserves strong location privacy for network kNN query. Extensive experiments under real world and synthetic datasets demonstrate the practicality of our approach.
机译:移动设备定位技术和普及性的开发使基于位置的服务(LBS)的兴趣产生了更高的兴趣。道路网络中的K最近邻居(KNN)查询是LBS中的重要查询类型,具有许多现实生活应用程序,如地图服务。然而,这种查询要求客户端向LBS披露敏感的位置信息。保留knn查询的唯一现有方法采用覆盖区域范例,将位置与空间区域产生。但是,LBS仍然可以推断出一些信息(尽管没有准确)。在本文中,我们的目标是强大的隐私,其中LBS没有关于查询位置的任何内容。为此,我们采用私人信息升值(PIR)技术,该技术匿名地从数据库匿名访问数据页面。基于PIR,我们提出了一种安全查询处理框架,以及灵活的Arcary Knn查询计划。据我们所知,这是第一个保留网络knn查询的强大位置隐私的研究。在现实世界和合成数据集下的广泛实验表明了我们方法的实用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号