计算机科学
大方坯过滤器
云计算
加密
布尔连接查询
操作码
树(集合论)
密码
连词查询
安全性分析
数据挖掘
理论计算机科学
计算机安全
计算机网络
萨尔盖博
搜索引擎
Web搜索查询
情报检索
操作系统
关系数据库
数学分析
数学
作者
Qin Jiang,Ee‐Chien Chang,Yong Qi,Saiyu Qi,Pengfei Wu,Jianfeng Wang
标识
DOI:10.1109/tifs.2022.3144877
摘要
Deploying data storage and query service in an untrusted cloud server raises critical privacy and security concerns. This paper focuses on the fundamental problem of processing conjunctive keyword queries over an untrusted cloud in a privacy-preserving manner. Previous tree-based searchable symmetric encryption (SSE) schemes, such as IBTree and VBTree, can process conjunctive keyword queries in a secure and efficient way. However, these schemes cannot address “Result Pattern (RP)” leakage, which can be used to recover the keywords contained in a conjunctive keyword query. To combat this challenging problem, we propose a result pattern hiding conjunctive query scheme named Rphx using Intel SGX. In particular, we first propose a new “SGX-aware” compressed index named VIBT by combining variable-length bloom filter tree, matryoshka filter and online cipher. To achieve RP hiding, we then introduce a new tree-based SSE scheme named Rphx by deploying VIBT to Intel SGX. Security analysis shows that Rphx can enhance the security requirements by hiding RP leakage under the IND-CKA2 security model. Experimental results show that VIBT gains at least $30\times $ improvement in storage efficiency and Rphx can achieve comparable search efficiency comparing with previous works.
科研通智能强力驱动
Strongly Powered by AbleSci AI