Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qinxi Zhou

dblp:284/8620 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › searchable encryption › searchable symmetric encryption
dynamic searchable symmetric encryption
0.512021
Secure Dynamic Searchable Symmetric Encryption With Constant Client Storage Cost · IEEE Trans. Inf. Forensics Secur. 2021
Cryptographic primitives and cryptanalysis › searchable encryption
searchable symmetric encryption
0.512021
Secure Dynamic Searchable Symmetric Encryption With Constant Client Storage Cost · IEEE Trans. Inf. Forensics Secur. 2021
Storage systems › secure storage
encrypted database
0.112021
Secure Dynamic Searchable Symmetric Encryption With Constant Client Storage Cost · IEEE Trans. Inf. Forensics Secur. 2021

Methods — techniques the papers use, named apart from their topics

forward and backward security · 1.0fish-bone chain · 1.0
YearPublicationVenuePosition
2021 Secure Dynamic Searchable Symmetric Encryption With Constant Client Storage Cost
abstract
Dynamic Searchable Symmetric Encryption (DSSE) enables users to search on the encrypted database stored on a semi-trusted server while keeping the search and update information under acceptable leakage. However, most existing DSSE schemes are not efficient enough in practice due to the complex structures and cryptographic primitives. Moreover, the storage cost on the client side grows linearly with the number of keywords in the database, which induces unaffordable storage cost when the size of keyword set is large. In this article, we focus on secure dynamic searchable symmetric encryption with constant client storage cost. Our framework is boosted by fish-bone chain, a novel two-level structure which consists of Logical Keyword Index Chain (LoKIC) and Document Index Chain (DIC). To instantiate the proposed framework, we propose a forward secure DSSE scheme, called CLOSE-F, and a forward and backward secure DSSE scheme, called CLOSE-FB. Experiments showed that the computation cost of CLOSE-F and CLOSE-FB are as efficient as the state-of-the-art solutions, while the storage costs on the client side are constant in both CLOSE-F and CLOSE-FB, which are much smaller than existing schemes.
Kun He 0008, Jing Chen 0003, Qinxi Zhou, Ruiying Du, Yang Xiang 0001
IEEE Trans. Inf. Forensics Secur.3