基于位置服务的安全高效查询方案  

A Secure and Effective Query Scheme Based on LBS

作　　者：胡宸 沈忠华[1,2] 孟倩 陈克非[1,2] 刘勇 梁焯阳 HU Chen;SHEN Zhonghua;MENG Qian;CHEN Kefei;LIU Yong;LIANG Zhuoyang(School of Mathematics,Hangzhou Normal University,Hangzhou 311121,China;Westone Crypto Logic Research Center,Beijing 100071,China;School of Information Science and Technology,Hangzhou Normal University,Hangzhou 311121,China)

机构地区：[1]杭州师范大学数学学院,浙江杭州311121 [2]卫士通摩石实验室,北京100071 [3]杭州师范大学信息科学与技术学院,浙江杭州311121

出　　处：《杭州师范大学学报（自然科学版）》2023年第6期641-648,共8页Journal of Hangzhou Normal University(Natural Science Edition)

基　　金：国家自然科学基金项目(62302136,U1705264,61972124);浙江省自然科学基金项目(LQ22F010001);杭州师范大学科研启动项目(4085C50220204093,4115C50221204137)。

摘　　要：大数据时代,基于位置服务得到了广泛关注.针对其存在的隐私安全问题,提出了一种密文时空数据的细粒度查询方案,利用kNN算法、R树和多项式拟合技术,实现了对任意闭合曲线的范围查询.安全性分析和性能仿真实验结果均证明了该方案的可行性和高效性.In the era of big data,location based services(LBS)have attracted widespread attention.In response to privacy and security problems of LBS,a fine-grained query scheme for ciphertext spatio-temporal data is proposed in this paper.By utilization of kNN algorithm,R tree and polynomial fitting techniques,range query for arbitrary closed curves could be realized.Furthermore,feasibility and efficiency of this scheme were proved by security analysis and performance simulation experiments.

关 键 词：基于位置服务 范围查询 KNN R树 多项式拟合 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]