计算机科学
大方坯过滤器
范围查询(数据库)
加密
同态加密
航程(航空)
散列函数
Web搜索查询
情报检索
搜索引擎索引
密文
理论计算机科学
查询优化
空间查询
空间数据库
语义安全
数据结构
查询语言
数据挖掘
访问方法
混淆
密码学
歪斜
空间分析
密码系统
数据存取
安全性分析
数据安全
交叉口(航空)
遮罩(插图)
访问控制
在线聚合
构造(python库)
数据库安全
入侵检测系统
滤波器(信号处理)
哈希表
Web查询分类
信息隐私
萨尔盖博
作者
Yinbin Miao,Xin Wang,Guijuan Wang,Yibing Wang,Kaifa Zheng,Xinghua Li,Zhiquan Liu,Robert Huijie Deng
标识
DOI:10.1109/tifs.2025.3648161
摘要
With the widespread use of encrypted spatial data, many range query schemes emerge to address potential security risks caused by access pattern leakage. However, most existing schemes rely on a dual-server model to hide access patterns and often involve complex spatial relation judgments during range comparisons, leading to low query efficiency. To address these issues, we propose a novel Fast and Access Hidden Range Query (FAHRQ) scheme. First, we introduce an efficient range membership verification technique based on Bloom filters and Lagrange interpolation function, combine homomorphic encryption to ensure the confidentiality of spatial data and the computational flexibility of related operations, and realize the access pattern hidden under single server. Then, we construct an index using R-tree and employ Bloom filters and prefix 0-1 encoding to accelerate the minimum bounding rectangle intersection judgment, enabling secure and efficient range queries over encrypted spatial data while maintaining retrieval accuracy. Finally, we give a formal security analysis to show that our scheme achieves access pattern hidden while protecting data security, and conduct extensive experiments to demonstrate that our scheme improves query efficiency by 5 – 7× compared to existing schemes.
科研通智能强力驱动
Strongly Powered by AbleSci AI