Searchable symmetric encryption (SSE) has been introduced for secure outsourcing the encrypted database to cloud storage, while maintaining searchable features. Of various SSE schemes, most of them assume the server is honest but curious, while the server may be trustless in the real world. Considering a malicious server not honestly performing the queries, verifiable SSE (VSSE) schemes are constructed to ensure the verifiability of the search results. However, existing VSSE constructions only focus on single-keyword search or incur heavy computational cost during verification.
Credit: HIGHER EDUCATION PRESS LIMITED COMPANY
Searchable symmetric encryption (SSE) has been introduced for secure outsourcing the encrypted database to cloud storage, while maintaining searchable features. Of various SSE schemes, most of them assume the server is honest but curious, while the server may be trustless in the real world. Considering a malicious server not honestly performing the queries, verifiable SSE (VSSE) schemes are constructed to ensure the verifiability of the search results. However, existing VSSE constructions only focus on single-keyword search or incur heavy computational cost during verification.
To address this challenge, a research team led by Joseph K. LIU published their new research on 02 April 2022 in Frontiers of Computer Science co-published by Higher Education Press and Springer Nature.
The team proposes a new VSSE construction supporting conjunctive keyword queries, which can be treated as an improvement of a recent VSSE solution. The proposed VSSE scheme is based on a privacy-preserving hash-based accumulator, by leveraging a well-established cryptographic primitive, Symmetric Hidden Vector Encryption (SHVE). The VSSE scheme enables both correctness and completeness verifiability for the result without pairing operations, thus greatly reducing the computational cost in the verification process.
For the future direction, one is to construct a public VSSE scheme by allowing any third-party to verify the search results. Another is to propose a forward private VSSE scheme supporting date update.
###
Research Article, Published: 02 April 2022
Qingqing GAN, Joseph K. LIU, Xiaoming WANG, Xingliang YUAN, Shi-Feng SUN, Daxin HUANG, Cong ZUO, Jianfeng WANG. Verifiable searchable symmetric encryption for conjunctive keyword queries in cloud storage. Front. Comput. Sci., 2022, 16(6): 166820, https://doi.org/10.1007/s11704-021-0601-8
About Frontiers of Computer Science (FCS)
FCS was launched in 2007. It is published bimonthly both online and in print by HEP and Springer. Prof. Zhi-Hua Zhou from Nanjing University serves as the Editor-in-Chief. It aims to provide a forum for the publication of peer-reviewed papers to promote rapid communication and exchange between computer scientists. FCS covers all major branches of computer science, including: architecture, software, artificial intelligence, theoretical computer science, networks and communication, information systems, multimedia and graphics, information security, interdisciplinary, etc. The readers may be interested in the special columns “Perspective” and “Excellent Young Scholars Forum”.
FCS is indexed by SCI(E), EI, DBLP, Scopus, etc. The latest IF is 2.061. FCS solicits the following article types: Review, Research Article, Letter.
Journal
Frontiers of Computer Science
DOI
10.1007/s11704-021-0601-8
Method of Research
Experimental study
Subject of Research
Not applicable
Article Title
Verifiable searchable symmetric encryption for conjunctive keyword queries in cloud storage
Article Publication Date
2-Apr-2022