保护两方隐私的多类型的路网K近邻查询方案  

Multi-type K-nearest Neighbor Query Scheme with Mutual Privacy-preserving in Road Networks

作　　者：曾聪爱 刘亚丽[1,2,3] 陈书仪 朱秀萍 宁建廷 ZENG Congai;LIU Yali;CHEN Shuyi;ZHU Xiuping;NING Jianting(College of Computer Science and Technology,Jiangsu Normal University,Xuzhou,Jiangsu 221116,China;Guangxi Key Laboratory of Cryptography and Information Security,Guilin University of Electronic Technology,Guilin,Guangxi 541004,China;Henan Key Laboratory of Network Cryptography Technology,Zhengzhou 450001,China;Fujian Provincial Key Laboratory of Network Security and Cryptology,Fujian Normal University,Fuzhou 350007,China)

机构地区：[1]江苏师范大学计算机科学与技术学院,江苏徐州221116 [2]广西密码学与信息安全重点实验室(桂林电子科技大学),广西桂林541004 [3]河南省网络密码技术重点实验室,郑州450001 [4]福建省网络安全与密码技术重点实验室(福建师范大学),福州350007

出　　处：《计算机科学》2024年第11期400-417,共18页Computer Science

基　　金：国家自然科学基金(61702237,61972094,62032005);徐州市科技计划项目(KC22052);广西密码学与信息安全重点实验室(桂林电子科技大学)研究课题(GCIS202114);河南省网络密码技术重点实验室研究课题(LNCT2021-A07);福建省网络安全与密码技术重点实验室(福建师范大学)开放课题(NSCL-KF2021-04);江苏师范大学研究生科研与实践创新计划项目(2022XKT1545,2021XKT1387,2021XKT1396);教育部产学合作协同育人项目(202101374001);江苏省自然科学基金(BK20150241);徐州市推动科技创新专项资金项目(KC18005);江苏省高校自然科学基金(14KJB520010);江苏政府留学奖学金。

摘　　要：在车联网场景中,现有基于位置服务的隐私保护方案存在不支持多种类型K近邻兴趣点的并行查询、难以同时保护车辆用户和位置服务提供商(Location-Based Service Provider,LBSP)两方隐私、无法抵抗恶意攻击等问题。为了解决上述问题,提出了一种保护两方隐私的多类型的路网K近邻查询方案MTKNN-MPP。将改进的k-out-of-n不经意传输协议应用于K近邻查询方案中,实现了在保护车辆用户的查询内容隐私和LBSP的兴趣点信息隐私的同时,一次查询多种类型K近邻兴趣点。通过增设车载单元缓存机制,降低了计算代价和通信开销。安全性分析表明,MTKNN-MPP方案能够有效地保护车辆用户的位置隐私、查询内容隐私以及LBSP的兴趣点信息隐私,可以保证车辆的匿名性,能够抵抗合谋攻击、重放攻击、推断攻击、中间人攻击等恶意攻击。性能评估表明,与现有典型的K近邻查询方案相比,MTKNN-MPP方案具有更高的安全性,且在单一类型K近邻查询和多种类型K近邻查询中,查询延迟分别降低了43.23%~93.70%,81.07%~93.93%。In the Internet of vehicles scenario,existing location-based service privacy-preserving schemes have issues such as not supporting parallel query of multi-type K-nearest neighbor points of interest,difficulty to protect the privacy of both the in-vehicle users and the location-based service provider(LBSP),and unable to resist malicious attacks.In order to solve the above issues,a multi-type K-nearest neighbor query scheme with mutual privacy-preserving in road networks,named as MTKNN-MPP is proposed.By applying the improved k-out-of-n oblivious transfer protocol to the K-nearest neighbor query scheme,it is realized that multi-type K-nearest neighbor points of interest can be queried at a time while protecting the privacy of the query content of in-vehicle user and the privacy of the points of interest information of LBSP.The addition of the onboard unit caching mechanism reduces computational cost and communication overhead.The security analysis shows that the MTKNN-MPP scheme can effectively protect the location privacy of in-vehicle users,query content privacy of in-vehicle users,and the privacy of points of interest information of LBSP,which ensures the anonymity of the vehicle's identity and can resist malicious attacks such as collusion attacks,replay attacks,inference attacks,and man-in-the-middle attacks.Performance evaluation shows that compared with the existing typical K-nearest neighbor query schemes,the MTKNN-MPP scheme has higher security and the query latency in single-type K-nearest neighbor query and multi-type K-nearest neighbor query is reduced by 43.23%~93.70%and 81.07%~93.93%,respectively.

关 键 词：基于位置的服务 两方隐私保护 K近邻查询 不经意传输协议 车联网 多类型 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]