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

Yutao Bao

dblp:436/2581 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0007-6951-2513ORCID · reported

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 · 50% Authentication and access control · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Authentication and access control
access control
1.012026
Attribute-Based Weight Exchange With Direct Revocation Mechanism for Fine-Grained Data Sharing · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
1.012026
Attribute-Based Weight Exchange With Direct Revocation Mechanism for Fine-Grained Data Sharing · IEEE Trans. Dependable Secur. Comput. 2026
Authentication and access control › identity management
attribute revocation
1.012026
Attribute-Based Weight Exchange With Direct Revocation Mechanism for Fine-Grained Data Sharing · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
ciphertext-policy attribute-based encryption
1.012026
Attribute-Based Weight Exchange With Direct Revocation Mechanism for Fine-Grained Data Sharing · IEEE Trans. Dependable Secur. Comput. 2026
Cloud and datacenter computing
cloud storage
0.312026
Attribute-Based Weight Exchange With Direct Revocation Mechanism for Fine-Grained Data Sharing · IEEE Trans. Dependable Secur. Comput. 2026

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

weight exchange · 2.0direct revocation · 2.0adaptive chosen-ciphertext security · 2.0
YearPublicationVenuePosition
2026 Attribute-Based Weight Exchange With Direct Revocation Mechanism for Fine-Grained Data Sharing
abstract
The ciphertext-policy attribute-based encryption (CPABE) for cloud storage data sharing not only enhances multi-user access control but also safeguards the data privacy. Nevertheless, current CPABE schemes often face challenges when deployed for users with limited computational capabilities, such as in IoT environments, including long ciphertexts and the substantial overhead involved in revoking user attributes. To mitigate challenges, we propose a cloud storage data-sharing framework which incorporates fine-grained attribute revocation and weight exchangeability (RWE-CPABE) with direct revocation mechanism. The weight threshold is converted into a set of 0-encoded values, thereby reducing the length of the ciphertext. Additionally, attribute weights are transformed into a 1-encoding set, which minimizes the number of weight keys required. Incorporating a user list within the ciphertext enables, thereby obviating users' need to alter their keys and preventing a linear increase in revocation costs. Furthermore, we introduce a methodology for mapping similar attributes to a common secret value, which enables attribute weight exchange and broadens access policy options. By delegating certain decryption operations to servers, we alleviate the computational burden on data users. RWE-CPABE achieves adaptive chosen-ciphertext attack (CCA2) security in the standard model while demonstrating superior efficiency—reducing cipher text length by 32% and revocation costs to O(1) versus prior linear-growth approaches—making it ideal for resource-constrained cloud environments.
Zuowen Tan, Yutao Bao, Qixin Min
IEEE Trans. Dependable Secur. Comput.2