检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宋成[1] 王治超 杨囡囡 SONG Cheng;WANG Zhichao;YANG Nannan(School of Computer Science and Technology,Henan Polytechnic University,Jiaozuo 454003,P.R.China)
机构地区:[1]河南理工大学计算机科学与技术学院,河南焦作454003
出 处:《重庆邮电大学学报(自然科学版)》2024年第2期367-373,共7页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基 金:国家自然科学基金项目(62273290);河南省科技攻关计划项目(212102210078,222102210092)。
摘 要:针对基于位置服务中移动终端用户位置隐私保护存在时空关联和背景知识攻击的问题,提出一种分配查询的k-匿名位置隐私保护方案。基于查询概率和欧氏距离,在相邻网格区域内筛选假位置,合并真实用户位置形成k-匿名;通过兴趣点语义四叉树为假位置分配合理的查询,从时间、位置及查询3个维度提升用户被识别的不确定性,从而增强用户隐私度。安全性分析表明,提出的方案满足匿名性、不可伪造性和抵抗查询服务跟踪等安全特性。仿真实验表明,提出的方案具有较高的隐私保护度和效率以及较低的通信开销。Aiming at the security and efficiency of location privacy protection for mobile terminal users in location-based services,a K-anonymous location privacy protection scheme based on assignment query is proposed.Considering spatio-temporal correlation and background knowledge attack,the scheme uses query probability and Euclidean distance to screen false locations in adjacent grid areas based on location service(LBS)request user identity anonymization,and combines real user locations to form K-anonymity.Considering the relationship between time,space and query,this paper allocates reasonable queries for false locations through the semantic quadtree of interest points,and improves the uncertainty of user identification from the three dimensions of time,location,and query,to enhance user privacy.Security analysis shows that the scheme meets the security characteristics of anonymity,unforgeability and resistance to query service tracing.Simulation results show that the scheme has higher privacy protection and efficiency,as well as lower communication overhead.
分 类 号:TN929[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.185.226