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

Zilin Zheng

dblp:385/6024 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—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%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › searchable encryption
keyword guessing attack
0.812024
Identity-Based Group Encryption With Keyword Search Against Keyword Guessing Attack · IEEE Trans. Inf. Forensics Secur. 2024
Cryptographic primitives and cryptanalysis › searchable encryption
public key encryption with keyword search
0.812024
Identity-Based Group Encryption With Keyword Search Against Keyword Guessing Attack · IEEE Trans. Inf. Forensics Secur. 2024
Cryptographic primitives and cryptanalysis
searchable encryption
0.812024
Identity-Based Group Encryption With Keyword Search Against Keyword Guessing Attack · IEEE Trans. Inf. Forensics Secur. 2024

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

identity-based cryptography · 0.8
YearPublicationVenuePosition
2024 Identity-Based Group Encryption With Keyword Search Against Keyword Guessing Attack
abstract
Public key Encryption with Keyword Search (PEKS) has emerged as a solution for the receiver to securely search the sender’s encrypted data on the cloud. However, the PEKS scheme is threatened by the Keyword Guessing Attack (KGA), which leaks the receiver’s keyword privacy. To resist KGA, researchers have inherited the authentication mechanism into the PEKS system (PAEKS) but also forbid using one trapdoor to search all sender’s encrypted data. In this paper, we explore the KGA problem from grouping senders and propose the notion of Identity-based Group Encryption with Keyword Search (IBGEKS), which leverages Identity-based cryptography to securely search encrypted data. Compared with the PAEKS scheme, the IBGEKS scheme can search the sender’s ciphertexts within the same group established by the receiver via one receiver’s trapdoor. For security, we analyze the KGA problem and propose ciphertexts, identities, and trapdoors indistinguishability for IBGEKS. The evaluation depicts that the IBGEKS has competitive algorithm performance with other SA-PEKS and PAEKS schemes and has superior search performance on the Enron email dataset.
Wei Wang 0088, Dongli Liu, Zilin Zheng, Peng Xu 0003, Laurence T. Yang
IEEE Trans. Inf. Forensics Secur.3