基于不可信环境的移动位置隐私保护  

Mobile Location Privacy Protection Based on Untrusted Environment

作　　者：刘学军[1] 陈玉凤[1] 李斌[1] 

机构地区：[1]南京工业大学电子与信息学院,南京211800

出　　处：《计算机科学》2015年第2期108-113,141,共7页Computer Science

基　　金：国家自然科学基金(61073197);江苏省科技支撑计划(SBE201077457)资助

摘　　要：近年来,随着移动计算和位置设备的发展,位置隐私保护受到学术界的广泛关注,人们提出很多匿名算法来保护用户的隐私信息。但是现有的方法要么不适用于移动环境,要么没有考虑现实不可信环境。针对这些问题提出了基于博弈论的动态规划匿名算法Dynamic_p。此方法是在已有的可解决不可信环境下的位置隐私保护Privacy_1[8]方法基础上提出的,通过将匿名组先组建成匿名树,然后从下到上,子节点与父节点博弈算出锚点。层层递归,最后算出整个匿名组的锚点。用户通过使用锚点代替实际位置来发起位置近邻查询,通过概率统计选出候选位置,最后通过位置计算算出最终的理想位置点。仿真实验表明,此方法在位置匿名方法上有更好的处理效率,并且能应用于移动的不可信环境中。With the development of mobile computing and location equipment technologies,location privacy protection receives extensive attention from academia in recent years.A lot of anonymity algorithm has been put forward to protect users＇ privacy information.However,the existing methods is either not suitable for mobile environment,or do not consider the untrusted environment.In light of these problems,this paper put forward Dynamic_p which is dynamic planning anonymity algorithm based on game theory.This method is proposed on the basic of Privacy_1[8]solving the privacy protection in the suspect environment.First it turns anonymous group into anonymous tree,and then child node cooperates with the parent node to calculate the anchor through game from the tree＇s bottom to top,finally it calculates the entire anchors of anonymous group through layers of recursive.After that,users initiate location neighbor query through using anchor of anonymous group instead of actual location,then select candidate locations by probability statistics,finally calculate the final ideal location through computation.Simulation results show that this method has better performance,and can be applied to mobile untrusted environment.

关 键 词：移动计算 位置服务 隐私保护 博弈 动态规划 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]