期刊文献+

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

A Secure and Effective Query Scheme Based on LBS
下载PDF
导出
摘要 大数据时代,基于位置服务得到了广泛关注.针对其存在的隐私安全问题,提出了一种密文时空数据的细粒度查询方案,利用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.
作者 胡宸 沈忠华 孟倩 陈克非 刘勇 梁焯阳 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)
出处 《杭州师范大学学报(自然科学版)》 CAS 2023年第6期641-648,共8页 Journal of Hangzhou Normal University(Natural Science Edition)
基金 国家自然科学基金项目(62302136,U1705264,61972124) 浙江省自然科学基金项目(LQ22F010001) 杭州师范大学科研启动项目(4085C50220204093,4115C50221204137)。
关键词 基于位置服务 范围查询 KNN R树 多项式拟合 location based services range query kNN R tree polynomial fitting
  • 相关文献

参考文献1

二级参考文献101

  • 1Papadopoulos A.N., Manolopoulos Y.. Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT, Delphi, Greece, 1997, 394~408. 被引量:1
  • 2An N., Yang Zhen-Yu, Sivasubramaniam A.. Selectivity estimation for spatial joins. In: Proceedings of ICDE, Heidelberg, Germany, 2001, 368~375. 被引量:1
  • 3Sun Chengyu, Agrawal D., Abbadi A.E.. Selectivity estimation for spatial joins with geometric selections. In: Proceedings of EDBT, Prague, Czech Republic, 2002, 609~626. 被引量:1
  • 4Kamel I., Faloutsos C.. Parallel R-trees. In: Proceedings of SIGMOD, San Diego, California, 1992, 195~204. 被引量:1
  • 5Papadopoulos A., Manolopoulos Y.. Similarity query processing using disk arrays. In: Proceedings of SIGMOD, Seattle, Washington, USA, 1998, 225~236. 被引量:1
  • 6Koudas N., Faloutsos C., Kamel I.. Declustering spatial databases on a multi-computer architecture. In: Proceedings of EDBT, Avignon, France, 1996, 592~614. 被引量:1
  • 7Brinkhoff T., Kriegel Hans-Peter, Seeger B.. Parallel processing of spatial joins using R-trees. In: Proceedings of ICDE, New Orleans, Louisiana, 1996, 258~265. 被引量:1
  • 8Papadopoulos A., Manolopoulos Y.. Parallel processing of nearest neighbor queries in declustered spatial data. In: Proceedings of ACM-GIS, Rockville, MD, 1996, 35~43. 被引量:1
  • 9Papadopoulos A., Manolopoulos Y.. Nearest neighbor queries in shared-nothing environments. Geoinformatica, 1997, 1(4): 369~392. 被引量:1
  • 10Fu X., Wang D., Zheng W.. GPR-tree: A global parallel index structure for multiattribute declustering on cluster of work- stations. In: Proceedings of APDC'97, Shanghai, China, 1997, 300~306. 被引量:1

共引文献94

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部