...
首页> 外文期刊>Soft computing: A fusion of foundations, methodologies and applications >An incentive mechanism for K-anonymity in LBS privacy protection based on credit mechanism
【24h】

An incentive mechanism for K-anonymity in LBS privacy protection based on credit mechanism

机译:基于信用机制的LBS隐私保护k-Anonymity的激励机制

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

摘要

In the location-based service (LBS) privacy protection, the most common and classic solution is K-anonymity, however, existing schemes rarely consider the issue that whether other mobile users are willing to provide assistance to the requesters to form the K-anonymity set, thus leading to their poor practicability. In this paper, an incentive mechanism based on credit is introduced into the distributed K-anonymity, and only providing assistance to the others, a user can gain and accumulate his credit. Based on the fuzzy logic in the soft computing, a probability threshold is introduced to reflect a user's reputation, and only when a user's reputation reaches this threshold, can he get the assistance from other neighbors. Security analysis shows that our scheme is secure with respect to various typical attacks. And because of not relying on a trusted third party, our scheme can avoid the security issue resulting from its breach. Extensive experiments indicate that the time to form the anonymity set is short and it increases slowly as the value of K increases. Finally, the additional traffic introduced by this scheme is very limited.
机译:在基于位置的服务(LBS)隐私保护中,最常见和最经典的解决方案是k-匿名,然而,现有方案很少考虑其他移动用户是否愿意为请求者提供帮助以形成k-匿名的问题套装,从而导致其实用性差。本文将基于信用的激励机制引入分布式k-匿名,并且仅向其他人提供援助,用户可以获得并积累他的信用。基于软计算中的模糊逻辑,引入了概率阈值来反映用户的声誉,并且只有当用户的信誉达到此阈值时,他才能从其他邻居获取帮助。安全分析表明,我们的方案对各种典型攻击是安全的。由于不依赖于可信任的第三方,我们的计划可以避免违规行为导致的安全问题。广泛的实验表明,形成匿名集的时间很短,随着K的值增加,它会缓慢增加。最后,该方案引入的额外流量非常有限。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号