首页> 外文会议>Grid and pervasive computing >A Grid-Based Approximate K-NN Query Processing Algorithm for Privacy Protection in Location-Based Services
【24h】

A Grid-Based Approximate K-NN Query Processing Algorithm for Privacy Protection in Location-Based Services

机译:基于网格的近似K-NN查询处理算法在基于位置的服务中的隐私保护

获取原文
获取原文并翻译 | 示例

摘要

Location-Based Services (LBSs) are becoming popular due to the advances in wireless networks and positioning capabilities. 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 methods which blur 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, the main disadvantages of existing work are high computation and communication overheads. To resolve these problems, we propose a grid-based approximate k-NN query processing algorithm by combining above two methods. Through performance analysis, we have shown that our scheme outperforms the existing work in terms of both query processing time and accuracy of the result set.
机译:由于无线网络和定位功能的进步,基于位置的服务(LBS)变得越来越流行。向LBS服务器提供用户的确切位置可能会导致向未经授权的方(例如,对手)泄露其私人信息。存在两个主要的研究领域来克服这个问题。它们是基于掩盖区域的查询处理方法,该方法将用户的位置模糊到掩盖区域;以及基于私有信息检索(PIR)的查询处理方法,该方法通过使用PIR协议对位置数据进行加密。但是,现有工作的主要缺点是较高的计算和通信开销。为了解决这些问题,我们结合上述两种方法提出了一种基于网格的近似k-NN查询处理算法。通过性能分析,我们表明,在查询处理时间和结果集准确性方面,我们的方案均优于现有工作。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号