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

Xiaotian Yan

dblp:87/5261 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0001-4631-7252ORCID · 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 · 100%
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
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.912025
Enhancing Secure Cloud Data Sharing: Dynamic User Groups and Outsourced Decryption · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
outsourced decryption
0.912025
Enhancing Secure Cloud Data Sharing: Dynamic User Groups and Outsourced Decryption · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
revocable attribute-based encryption
0.912025
Enhancing Secure Cloud Data Sharing: Dynamic User Groups and Outsourced Decryption · IEEE Trans. Dependable Secur. Comput. 2025
Cloud and datacenter computing › cloud data management
cloud data sharing
0.312025
Enhancing Secure Cloud Data Sharing: Dynamic User Groups and Outsourced Decryption · IEEE Trans. Dependable Secur. Comput. 2025
Cloud and datacenter computing › access control
fine-grained access control
0.312025
Enhancing Secure Cloud Data Sharing: Dynamic User Groups and Outsourced Decryption · IEEE Trans. Dependable Secur. Comput. 2025

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

elgamal-type cryptosystem · 1.7key encapsulation mechanisms · 0.9key encapsulation mechanism · 0.9
YearPublicationVenuePosition
2025 Enhancing Secure Cloud Data Sharing: Dynamic User Groups and Outsourced Decryption
abstract
Cloud computing, as a persuasive paradigm, offers on-demand data services. However, it faces various security threats during data sharing due to trust issues. To mitigate this problem, many cloud-based data-sharing systems employ cryptographic tools to guarantee the confidentiality of sensitive data. Nevertheless, fine-grained data sharing still suffers from many challenges, especially in complex cloud environments. In this paper, we introduce two cloud-based data-sharing systems with fine-grained access control. The first solution supports dynamic user groups, while the second solution further offers outsourced decryption, enabling compatibility with resource-constrained devices. To formalize our solution theoretically, we introduce the concept of ElGamal -type cryptosystem (ETC) and server-aided ETC with key encapsulation mechanism to generalize public-key encryption with specific features implicitly specified by ElGamal encryption. Through the application of ETC, we present generic constructions for revocable attribute-based encryption (RABE) and server-aided RABE (SR-ABE) with formal definitions and security analyses. These schemes serve as the fundamental mechanisms behind our proposed solutions. By applying the state-of-the-art attribute-based encryption scheme proposed in CCS'22, we introduce instantiations of RABE and SR-ABE with various desirable properties, including large universe, attribute multi-use, key exposure resistance, fast decryption, and more. Extensive experiments substantiate the superior performance of our proposed instantiations over previous solutions.
Shengmin Xu, Guomin Yang, Xiaoguo Li, Xingshuo Han, Xiaotian Yan, Xinyi Huang 0001
IEEE Trans. Dependable Secur. Comput.5