首页> 外文会议>Grid and pervasive computing >Density-Based K-Anonymization Scheme for Preserving Users' Privacy in Location-Based Services
【24h】

Density-Based K-Anonymization Scheme for Preserving Users' Privacy in Location-Based Services

机译:基于密度的K匿名化方案在基于位置的服务中保护用户的隐私

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

摘要

Due to the explosive growth of location-detection devices, such as GPS (Global Positioning System), a user' privacy threat is continuously increasing in location-based services (LBSs). However, the user must precisely disclose his/her exact location to the LBS while using such services. So, it is a key challenge to efficiently preserve a user's privacy in LBSs. For this, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, it suffers from privacy attack. Therefore, we, in this paper, propose a density-based k-anonymization scheme using a weighted adjacency graph to preserve a user's privacy. Our k-anonymization scheme can reduce bandwidth usages and efficiently support k-nearest neighbor queries without revealing the private information of the query initiator. We demonstrate from experimental results that our scheme yields much better performance than the existing one.
机译:由于诸如GPS(全球定位系统)之类的位置检测设备的爆炸性增长,基于位置的服务(LBS)中的用户隐私威胁不断增加。但是,用户在使用此类服务​​时必须向LBS准确披露其确切位置。因此,有效地维护LBS中用户的隐私是一项关键挑战。为此,现有方法采用2PASS伪装框架,该框架不仅隐藏了实际的用户位置,而且还减少了带宽消耗。但是,它遭受隐私攻击。因此,我们在本文中提出了一种基于加权的k匿名化方案,该方案使用加权邻接图来保护用户的隐私。我们的k匿名方案可以减少带宽使用,并有效地支持k最近邻居查询,而不会泄露查询启动器的私有信息。我们从实验结果证明,我们的方案比现有方案具有更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号