检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宋成[1] 金彤 倪水平[1] 贺军义[1] 杜守恒[1] SONG Cheng;JIN Tong;NI Shuiping;HE Junyi;DU Shouheng(School of Computer Science and Technology,Henan Polytechnic University,Jiaozuo 454003,China)
机构地区:[1]河南理工大学计算机科学与技术学院,河南焦作454003
出 处:《西安电子科技大学学报》2021年第3期138-145,共8页Journal of Xidian University
基 金:国家自然科学基金(61872126,61772159);河南省科技攻关计划(192102210123,182102110333,212102210092)。
摘 要:针对当前位置隐私保护方案安全和效率问题,提出一种面向移动终端的K匿名位置隐私保护方案。首先在匿名区域选取2K个合理假位置,然后根据位置熵,从中筛选出K-1个较优位置,进而达到更优匿名效果;采用安全高效的不经意传输协议,避开了传统方案对可信匿名中心的依赖,提高了方案效率;同时可实现一次查询多个兴趣点的需求。安全分析表明,该方案满足匿名性,抗重放攻击和不可伪造性等安全特性。仿真结果显示,该方案具有更高的执行效率和隐私度,并具有较低的通信开销。In view of the security and effectiveness of the current location privacy protection scheme,we propose a K-anonymous location privacy protection scheme for the mobile terminal.In this scheme,2K valid dummy locations are obtained from the cloaking regions,and then K-1 better locations are selected from them according to the position entropy,so as to achieve a better anonymous effect.The secure and efficient oblivious transfer protocol is adopted,which avoids the dependence on the trusted anonymous center,improves the scheme′s efficiency,and realizes the requirement of querying multiple interest points at one time.Security analysis shows that the scheme not only satisfies the unforgeability,but also resists the playback attack.Meanwhile,simulation indicates that the scheme can improve the execution efficiency,enhance the level of privacy protection,and reduce the communication overhead.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.198