Journal of Computer Applications ›› 2017, Vol. 37 ›› Issue (2): 488-493.DOI: 10.11772/j.issn.1001-9081.2017.02.0488

Previous Articles     Next Articles

Privacy-preserving trajectory data publishing based on non-sensitive information analysis

DENG Jingsong1, LUO Yonglong1,2, YU Qingying1,2, CHEN Fulong1,2   

  1. 1. School of Mathematics and Computer Science, Anhui Normal University, Wuhu Anhui 241003, China;
    2. Engineering Technology Research Center of Network and Information Security, Anhui Normal University, Wuhu Anhui 241003, China
  • Received:2016-07-22 Revised:2016-09-05 Online:2017-02-10 Published:2017-02-11
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61370050,61672039), the Natural Science Foundation of Anhui Province (1508085QF134).

基于非敏感信息分析的轨迹数据隐私保护发布

邓劲松1, 罗永龙1,2, 俞庆英1,2, 陈付龙1,2   

  1. 1. 安徽师范大学 数学计算机科学学院, 安徽 芜湖 241003;
    2. 安徽师范大学 网络与信息安全工程技术研究中心, 安徽 芜湖 241003
  • 通讯作者: 邓劲松,18726154578@163.com
  • 作者简介:邓劲松(1991-),男,安徽合肥人,硕士研究生,主要研究方向:信息安全、隐私保护;罗永龙(1972-),男,安徽太湖人,教授,博士生导师,博士,CCF会员,主要研究方向:空间数据处理、信息安全、隐私保护;俞庆英(1980-),女,安徽黄山人,讲师,博士研究生,CCF会员,主要研究方向:空间数据处理、信息安全;陈付龙(1978-),男,安徽霍邱人,教授,博士,CCF会员,主要研究方向:嵌入式和普适计算、信息物理融合系统、高性能计算机体系结构。
  • 基金资助:
    国家自然科学基金资助项目(61370050,61672039);安徽省自然科学基金资助项目(1508085QF134)。

Abstract: Focusing on the issue of privacy disclosure between trajectory and non-sensitive information, a trajectory privacy preserving algorithm based on non-sensitive information analysis was proposed. Firstly, the correlation between trajectory and non-sensitive information was analyzed to build trajectory privacy disclosure decision model, and the Minimal Violating Sequence tuple (MVS) was gotten. Secondly, using common subsequences, the doublets with the minimal loss of trajectory data in MVS were selected as the suppression objects when removing the privacy risks caused by MVS, then the anonymized trajectory dataset with privacy and low data loss was obtained. In the comparison experiments with LKC-Local algorithm and Trad-Local algorithm, when the sequence length is 3, the average instance loss of the proposed algorithm is decreased by about 6% and 30% respectively, and the average MFS (Maximal Frequent Sequence) loss is decreased by about 7% and 60% respectively. The experimental results verify that the proposed algorithm can effectively improve the quality of recommend service.

Key words: privacy-preserving, high-dimensional trajectory data, non-sensitive information, common subsequence, sequence-suppression

摘要: 针对轨迹数据发布时轨迹和非敏感信息引起的隐私泄露问题,提出一种基于非敏感信息分析的轨迹数据隐私保护发布算法。首先,分析轨迹和非敏感信息的关联性构建轨迹隐私泄露判定模型,得到最小违反序列元组(MVS),然后借鉴公共子序列的思想,在消除MVS带来的隐私泄露风险时,选择MVS中对轨迹数据损失最小的时序序列作为抑制对象,从而生成具有隐私能力和低数据损失率的匿名轨迹数据集。仿真实验结果表明,与LKC-Local算法和Trad-Local算法相比,在序列长度为3的情况下,该算法平均实例损失率分别降低了6%和30%,平均最大频繁序列(MFS)损失率分别降低了7%和60%,因此所提算法能够有效用于提高推荐服务质量。

关键词: 隐私保护, 高维轨迹数据, 非敏感信息, 公共子序列, 序列抑制

CLC Number: