可验证秘密共享
计算机科学
加密
对称密钥算法
方案(数学)
连词查询
布尔连接查询
理论计算机科学
数据库
计算机安全
公钥密码术
情报检索
Web搜索查询
搜索引擎
数学
萨尔盖博
程序设计语言
数学分析
集合(抽象数据类型)
关系数据库
作者
Haitang Lu,Jie Chen,Jianting Ning,Kai Zhang
标识
DOI:10.1093/comjnl/bxac084
摘要
Abstract Dynamic searchable symmetric encryption (DSSE) with forward and backward privacy makes it possible to perform search on the outsourced encrypted database efficiently while still allowing updates under acceptable leakage. Current forward and backward private DSSE (FB-DSSE) scheme proposed by Zuo et al. cannot support conjunctive keyword query and the cloud server needs to be honest-but-curious. Recent FB-DSSE scheme supporting conjunctive keyword query proposed by Patranabis et al. cannot verify search results. On the other hand, searchable symmetric encryption scheme proposed by Wang et al. that supports conjunctive keyword query and the verification of search results cannot achieve forward and backward privacy. The problem of constructing a verifiable conjunctive FB-DSSE scheme is still open. In this paper, we propose a verifiable conjunctive dynamic searchable symmetric encryption scheme (VCDSSE). VCDSSE is a FB-DSSE scheme that additionally supports the verification of search results and conjunctive keyword query. We revisit homomorphic MAC to enable efficient verification of search results, adopt the technique of oblivious cross-tags to achieve conjunctive keyword query and utilize state chain to ensure forward and backward privacy. The formal security analysis and performance evaluation demonstrate that VCDSSE is secure and practical as compared with Mitra scheme in terms of search time.
科研通智能强力驱动
Strongly Powered by AbleSci AI