【24h】

Location-Semantic Aware Privacy Protection Algorithms for Location-Based Services

机译:基于位置的服务的位置语义感知隐私保护算法

获取原文
获取外文期刊封面目录资料

摘要

Location-semantic has become one of the key factors that lead to privacy disclosure in LBS. To solve this problem, we first propose sensitivity-fading algorithm (SFA). As there may be various semantics on a road, we design the semantic-influence vector for each road in the road networks. By calculating the sensitivity of each road based on the semantic-influence vector and selecting the road with the lowest sensitivity, SFA generates the cloaking set (CS) quickly. However, it is vulnerable to inference attack and replay attack. Thus, we also propose the weight-based sensitivity-fading algorithm (WB-SFA). It calculates the weight of each candidate road according to the distance between the candidate road and the road where the user located and gets the sensitivity of each candidate road based on the road's weight and semantic-influence vector. The road with the lowest sensitivity would be added into the CS. The experimental results show that both the two algorithms can guarantee a high success rate in generating CS. The SFA can generate CS at a faster speed while the WB-SFA has strong capability for resisting the inference attack and replay attack.
机译:位置语义已成为导致LBS隐私泄露的关键因素之一。为了解决这个问题,我们首先提出灵敏度衰减算法(SFA)。由于道路上可能存在各种语义,因此我们为道路网络中的每条道路设计了语义影响向量。通过基于语义影响向量计算每条道路的敏感度并选择敏感度最低的道路,SFA可以快速生成隐身集(CS)。但是,它容易受到推理攻击和重播攻击。因此,我们还提出了基于权重的灵敏度衰减算法(WB-SFA)。它根据候选道路与用户所在道路之间的距离来计算每个候选道路的权重,并基于道路的权重和语义影响向量来获取每个候选道路的敏感度。灵敏度最低的道路将添加到CS中。实验结果表明,两种算法都可以保证生成CS的高成功率。 SFA可以更快的速度生成CS,而WB-SFA具有强大的抵抗推理攻击和重放攻击的能力。

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号