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

Zhen Guo 0001

dblp:35/6453-1 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0001-6100-8856ORCID · conflict

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

Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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 · 50% Authentication and access control · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Authentication and access control › access control models
attribute-based access control
1.012026
UR-CP-ABE: CP-ABE With Flexible Construction Mechanism and Efficient User Revocation Capability for Access Control in the Cloud · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
1.012026
UR-CP-ABE: CP-ABE With Flexible Construction Mechanism and Efficient User Revocation Capability for Access Control in the Cloud · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
ciphertext-policy attribute-based encryption
1.012026
UR-CP-ABE: CP-ABE With Flexible Construction Mechanism and Efficient User Revocation Capability for Access Control in the Cloud · IEEE Trans. Dependable Secur. Comput. 2026
Authentication and access control › identity management
user revocation
1.012026
UR-CP-ABE: CP-ABE With Flexible Construction Mechanism and Efficient User Revocation Capability for Access Control in the Cloud · IEEE Trans. Dependable Secur. Comput. 2026
Cloud and datacenter computing › cloud data management
cloud data sharing
0.312026
UR-CP-ABE: CP-ABE With Flexible Construction Mechanism and Efficient User Revocation Capability for Access Control in the Cloud · IEEE Trans. Dependable Secur. Comput. 2026
Cloud and datacenter computing › cloud storage
encrypted data sharing
0.312026
UR-CP-ABE: CP-ABE With Flexible Construction Mechanism and Efficient User Revocation Capability for Access Control in the Cloud · IEEE Trans. Dependable Secur. Comput. 2026

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

double encryption · 2.0decisional q-parallel BDHE · 2.0binary tree · 2.0
YearPublicationVenuePosition
2026 UR-CP-ABE: CP-ABE With Flexible Construction Mechanism and Efficient User Revocation Capability for Access Control in the Cloud
abstract
Ciphertext-Policy Attribute-Based Encryption (CP-ABE) schemes with user revocation allow for dynamic updates to users' access rights. However, existing schemes often encounter issues such as low re-encryption efficiency, inflexible access control, and susceptibility to collusion attacks. To address these challenges, we propose UR-CP-ABE, an efficient user revocation scheme built upon a double encryption method. Specifically, UR-CP-ABE stores both valid and revoked users' identity information in a binary tree. This design enables flexible user authority revocation by modifying only the binary tree's relevant secret sub-items. Moreover, the scheme limits the scope of revocation-induced binary tree updates to a single sub-item. This key optimization resolves the critical issue where re-encryption overhead scales linearly with the number of attributes of revoked users. In addition, we eliminate the possibility of attackers constructing secret sub-keys, preventing the collusion attacks. UR-CP-ABE also supports bidirectional revocation, allowing for the revocation and restoration of user rights, which is not available in other related schemes. Our theoretical analysis and experiments demonstrate that UR-CP-ABE has better performance than other schemes, especially in the re-encryption stages. Moreover, UR-CP-ABE has been proved to be secure based on the decisionalq-parallel BDHEhardness assumption in the standard model.
Zhen Guo 0001, Jiangkai Gao, Shuainan Liu, Rong Wang 0006, Chaosheng Feng, Keping Yu, Kim-Kwang Raymond Choo, Mohsen Guizani
IEEE Trans. Dependable Secur. Comput.1
2026 Dynamic Anchor-Based One-Step Hypergraph Ensemble Clustering
Jiaxuan Xu 0001, Lei Duan, Xinye Wang, Liang Du 0003, Yidan Zhang 0001, Zhen Guo 0001
IEEE Trans. Knowl. Data Eng.6
2022 Blockchain-Based Cross-Domain Authentication for Intelligent 5G-Enabled Internet of Drones
abstract
While 5G can facilitate high-speed Internet access and make over-the-horizon control a reality for unmanned aerial vehicles (UAVs; also known as drones), there are also potential security and privacy considerations, for example, authentication among drones. Centralized authentication approaches not only suffer from a single point of failure but they are also incapable of cross-domain authentication. This complicates the cooperation of drones from different domains. To address these limitations, a blockchain-based cross-domain authentication scheme for intelligent 5G-enabled Internet of drones is proposed in this article. Our approach employs multiple signatures based on threshold sharing to build an identity federation for collaborative domains. This allows us to support domain joining and exiting. Reliable communication between cross-domain devices is achieved by utilizing smart contract for authentication. The session keys are negotiated to secure subsequent communication between two parties. Our security and performance evaluations show that the proposed scheme is resistant to common attacks targeting Internet of Things (IoT) devices (including drones), as well as demonstrating its effectiveness and efficiency.
Chaosheng Feng, Bin Liu 0070, Zhen Guo 0001, Keping Yu, Zhiguang Qin, Kim-Kwang Raymond Choo
IEEE Internet Things J.3