计算机科学
布尔连接查询
可验证秘密共享
加密
对称密钥算法
连词查询
查询优化
计算机安全
理论计算机科学
公钥密码术
计算机网络
Web搜索查询
萨尔盖博
情报检索
搜索引擎
程序设计语言
关系数据库
集合(抽象数据类型)
作者
Cheng Guo,Wenfeng Li,Xinyu Tang,Kim‐Kwang Raymond Choo,Yining Liu
出处
期刊:IEEE Transactions on Dependable and Secure Computing
[Institute of Electrical and Electronics Engineers]
日期:2023-01-01
卷期号:: 1-17
标识
DOI:10.1109/tdsc.2023.3262060
摘要
Dynamic searchable symmetric encryption (DSSE) allows efficient searches over encrypted databases and also supports clients in their updating of the data, such as those stored in a remote cloud server. However, recent attacks suggest the risk of leakage during such updates, which consequently impacts on the privacy of the queries. In addition, existing DSSE schemes that support forward privacy generally rely on the honest-but-curious server and support only single-keyword retrieval, which limits the application scenarios. In this paper, we present the design of a verifiable DSSE protocol, which supports efficient conjunctive query with forward privacy. In our scheme, the forward index is constructed by a novel form, i.e., $ t$ -puncturable PRFs, and the authentication tag is designed by symmetric cryptography. During conjunctive queries, we narrow the scope by an inverted index, and then we determine the results of the final query through the forward index. Meanwhile, we can use verification tag to check the correctness and completeness of the result. In addition, we give an extension to support the backward privacy and our experimental evaluations show that our proposed approach achieves better performance on both conjunctive queries and updates than other competing solutions, and possesses efficient verification.
科研通智能强力驱动
Strongly Powered by AbleSci AI