首页> 外文会议>High Performance Computing and Communications, 2009. HPCC '09 >A New Grid-Based Cloaking Algorithm for Privacy Protection in Location-Based Services
【24h】

A New Grid-Based Cloaking Algorithm for Privacy Protection in Location-Based Services

机译:一种新的基于网格的隐身算法,用于基于位置的服务中的隐私保护

获取原文

摘要

In Location-Based Services (LBSs), users send location-based queries to LBS servers along with their exact locations, but the location information of the users can be misused by adversaries. For this, a mechanism to deal with the userspsila privacy protection is required. In this paper, we propose a new cloaking algorithm for privacy protection in LBSs. Our cloaking algorithm can support both k-anonymity and l-diversity. That is, it first creates a minimum cloaking region by finding l buildings (l-diversity) and then finds k users (k-anonymity). To generate the minimum cloaking region efficiently, we make use of a grid structure for storing buildings and users as well as a pruning technique for reducing unnecessary computation. Finally, we show from our performance analysis that our cloaking algorithm outperforms the existing grid-based cloaking algorithm, in terms of the size of cloaking regions, their creation time and query processing time based on them.
机译:在基于位置的服务(LBS)中,用户将基于位置的查询及其确切位置发送到LBS服务器,但是用户的位置信息可能会被对手滥用。为此,需要一种处理用户psila隐私保护的机制。在本文中,我们提出了一种用于LBS中隐私保护的新的隐藏算法。我们的伪装算法可以支持k匿名和l分集。也就是说,它首先通过找到l个建筑物(l个多样性)来创建最小的隐身区域,然后找到k个用户(k个匿名性)。为了有效地生成最小的隐身区域,我们使用了用于存储建筑物和用户的网格结构以及用于减少不必要计算的修剪技术。最后,从性能分析中可以看出,在隐藏区域的大小,它们的创建时间和基于它们的查询处理时间方面,我们的隐藏算法优于现有的基于网格的隐藏算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号