首页> 外文会议>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,我们针对任意kNN查询提出了一个安全的查询处理框架以及灵活的查询计划。据我们所知,这是第一个为网络kNN查询保留强大的位置隐私的研究。在现实世界和综合数据集下进行的大量实验证明了我们方法的实用性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号