检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]福州大学数学与计算机科学学院,福建福州350108
出 处:《山东大学学报(工学版)》2012年第5期96-101,共6页Journal of Shandong University(Engineering Science)
基 金:福建省自然科学基金资助项目(2010J01330);福州大学科技发展基金资助项目(2010-XY-18;2010-XY-20)
摘 要:目前关于位置服务中的位置隐私保护研究大多是面向欧式空间,其相关模型及算法无法直接用于解决路网环境下位置服务中可能存在的隐私泄露问题。本研究针对公路网络下用户分布不均可能导致的推断攻击,设计出一种面向路网限制的位置隐私保护算法。本算法通过对公路网络的边权进行排序,并结合路段地理位置分布,进行隐匿边集的构造,以达到降低边权不均引起推断攻击的风险。通过实验对本算法的可行性及有效性与同类算法进行了比较分析。实验结果表明,本算法是有效可行的。Recently, the privacy preserving location-based services has been a hot topic in data privacy preserving re- search fields. The existed researches on location privacy preserving mainly focused on Euclidean space. However, many location-based services were under road-network environment, whose distribution of users was possibly unbalanced, which could make the traditional location privacy models and methods under Euclidean space unusable. A location pri- vacy protection algorithm was proposed to prevent the inferring attack caused by the unbalanced distribution of users in road-network. The key idea of the proposed algorithm was that the cloaked segment set was constructed by sorting edges with edge weight and taking the geographical position distribution of users into consideration. Experimental analysis was designed by comparing the proposed algorithm and the traditional algorithm on the feasibility and effectiveness. Experimental results showed that the proposed algorithm was effective and feasible.
关 键 词:位置隐私保护 公路网络 边权不均 边权推断攻击 隐匿边集 查询代价
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.86.137