首页> 外文会议>Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy >The Frechet/Manhattan Distance and the Trajectory Anonymisation Problem
【24h】

The Frechet/Manhattan Distance and the Trajectory Anonymisation Problem

机译:Frechet /曼哈顿距离和轨迹匿名问题

获取原文

摘要

Mobile communication has grown quickly in the last two decades. Connections can be wirelessly established from almost any habitable place in the earth, leading to a plethora of connection-based tracking mechanisms, such as GPS, GSM, RFID, etc. Trajectories representing the movement of people are consequently being gathered and analysed in a daily basis. However, a trajectory may contain sensitive and private information, which raises the problem of whether spatio-temporal data can be published in a private manner. In this article, we introduce a novel distance measure for trajectories that captures both aspect of the microaggregation process, namely clustering and obfuscation. Based on this distance measure we propose a trajectory anonymisation heuristic method ensuring that each trajectory is indistinguishable from k-1 other trajectories. The proposed distance measure is loosely based on the Frechet distance, yet it can be computed efficiently in quadratic time complexity. Empirical studies on synthetic trajectories show that our anonymisation approach improves previous work in terms of utility without sacrificing privacy.
机译:移动通信在过去二十年中已经发展得很快。可以从地球上几乎任何可居住的地方无线地建立连接,导致基于连接的基于连接的跟踪机制,例如GPS,GSM,RFID等。因此,代表人们运动的轨迹被收集和分析基础。然而,轨迹可能包含敏感性和私人信息,其提出了以私人方式发布时空数据的问题。在本文中,我们介绍了一种新的距离测量轨迹,捕获微识别过程的两个方面,即聚类和混淆。基于该距离测量,我们提出了一种轨迹匿名启发式方法,确保每个轨迹无法从k-1其他轨迹中无法区分。所提出的距离测量基于Frechet距离松散地,但它可以在二次时间复杂度中有效地计算。综合轨迹的实证研究表明,我们的匿名方法在不牺牲隐私的情况下,在公用事业方面提高了以前的工作。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号