路网限制环境中基于匿名蜂窝的位置隐私保护  

Location privacy protection through anonymous cells in road network

作　　者：徐建[1] 徐明[1] 林欣[2] 郑宁[1] 

机构地区：[1]杭州电子科技大学计算机学院,浙江杭州310018 [2]华东师范大学信息科学技术学院,上海200241

出　　处：《浙江大学学报（工学版）》2011年第3期429-434,439,共7页Journal of Zhejiang University：Engineering Science

基　　金：国家自然科学基金资助项目(61003195;60903169);浙江省自然科学基金资助项目(Y106427)

摘　　要：为了解决路网限制上下文环境的位置隐私保护问题,提出一个基于匿名蜂窝的位置隐私保护算法.根据路网环境特殊的点、线网络结构,事先将道路网络处理成由道路交叉点为圆心的圆形基本匿名区域———匿名蜂窝组成的网络.使用Hilbert曲线对匿名蜂窝进行空间编码,在算法中使用B+树对其进行索引.讨论了基于匿名蜂窝对用户查询进行匿名处理的2种成组方法:相邻结点优先成组和相邻路径结点优先成组,并对它们进行分析比较.在具体描述该算法的同时,进行了理论分析.通过实验验证了算法的可行性.实验结果表明:基于匿名蜂窝的相邻路径结点优先成组方法能够较好的增强算法应对推理攻击的鲁棒性.To solve the problem of location privacy protection under restricted context in road network,this work developed and demonstrated a privacy protection algorithm.According to the characteristics of points and lines structure in the road network,the network is divided into anonymous cells with each road intersection as the center in advance.Cells are coded with Hilbert curve and indexed by a B＋ tree.Two cellular-based methods for query anonymous processing nearest neighbor first and nearest road first were introduced.Then the two methods were analyzed and compared.Data from a real city map simulation show the effectiveness of the algorithm.The results prove that the nearest road first cloaking method can achieve more location privacy without loss of efficiency than the other,therefore improve the robustness against inference attacks.

关 键 词：道路网络 位置隐私 匿名蜂窝 基于位置的服务 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]