首页> 外文会议>Annual IFIP WG 11.3 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

机译:弗里谢/曼哈顿距离和轨迹匿名化问题

获取原文

摘要

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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号