信息网络安全 ›› 2015, Vol. 15 ›› Issue (3): 23-27.doi: 10.3969/j.issn.1671-1122.2015.03.005

• 技术研究 • 上一篇    下一篇

基于个性化空间匿名算法最优化选择研究

张海川1(), 赵泽茂2, 田玉杰1, 李学双1   

  1. 1.杭州电子科技大学通信工程学院,浙江杭州310018
    2. 丽水学院工学院,浙江丽水 323000
  • 收稿日期:2014-11-13 出版日期:2015-03-10 发布日期:2015-05-08
  • 作者简介:

    作者简介: 张海川(1989-),男,安徽,硕士研究生,主要研究方向:信息安全;赵泽茂(1965-),男,四川,教授,博士,主要研究方向:信息安全与密码学;田玉杰(1987-),男,山东,硕士研究生,主要研究方向:信息安全。

  • 基金资助:
    国家自然科学基金[61272045]

An Optimization Selection Research Based on Personalized Space Anonymous Algorithm

ZHANG Hai-chuan1(), ZHAO Ze-mao2, TIAN Yu-jie1   

  1. 1.Department of Communication Engineering, Hangzhou Dianzi University, Hangzhou Zhejiang 310008, China
    2. Department of Industrial and Design, Lishui University, Lishui Zhejiang 323000, China
  • Received:2014-11-13 Online:2015-03-10 Published:2015-05-08

摘要:

Bottom-Up grid算法和Top-Down grid算法都是基于网格划分空间的高效匿名算法,不同的算法其最终需要查询的迭代次数、形成的匿名区大小、用户得到的相对匿名度都有可能不同,这些因素之间的关系是矛盾的,但对查询质量都有着重要的影响。不同的移动用户在不同情况下发送位置服务请求时,对影响查询质量的迭代次数、匿名区域、相对匿名度这3个准则都有着自己的个性化要求。为了解决这个问题,文章在Bottom-Up grid算法和Top-Down grid算法这两种算法的基础上提出了一种基于个性化需求的最优化算法选择方法。该方法首先根据层析分析法(AHP)对3个准则进行数学建模,然后根据用户对这3个准则的评估构造正互反矩阵并进行一致性检验,最后通过对两种算法的实验模拟,计算两种算法的权重,最终选择权重值较大的算法。此最优化选择方法在满足匿名度 的条件下也符合用户针对不同情况的个性化需求。

关键词: 位置隐私保护, 网格划分空间, 层次分析法, 最优优选择

Abstract:

The algorithm of Bottom and Top-Downgrid are high-performance anonymous algorithm based on grid-partitioning space. Different algorithm needs different parameter criteria, such as iterations, the size of anonymous area, and the degree of users’ anonymity. These parameters have great impact on query quality, but all of them are contrary. When mobile users transmit location service request under different situations, they may have their own individual requirements about these parameters. To solve the problem, this paper gives an idea of optimal choice based on personalize space anonymous algorithm. Firstly, the method mathematical modeling analysis these parameters based on AHP. Secondly, it structure a straight reciprocal matrix based on the user’s review of these three criteria and check the consistency. Lastly, experiments and simulations are performed to calculate the weight of Bottom and Top-Downgrid, then chose the algorithm with bigger weight. The method of optimal choice based on these two algorithms not only satisfies the demand of k-degree, but also conform to the user’s need in different situations.

Key words: location privacy, grid-partitioning space, AHP, optimal choice

中图分类号: