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

Gaosheng Tan

dblp:198/8148 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

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

Security and privacy · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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 · 67% Authentication and access control · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Authentication and access control › access control models
attribute-based access control
0.612022
Server-Aided Fine-Grained Access Control Mechanism with Robust Revocation in Cloud Computing · IEEE Trans. Serv. Comput. 2022
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
outsourced decryption
0.612022
Server-Aided Fine-Grained Access Control Mechanism with Robust Revocation in Cloud Computing · IEEE Trans. Serv. Comput. 2022
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
revocable attribute-based encryption
0.612022
Server-Aided Fine-Grained Access Control Mechanism with Robust Revocation in Cloud Computing · IEEE Trans. Serv. Comput. 2022
Cloud and datacenter computing
cloud storage
0.212022
Server-Aided Fine-Grained Access Control Mechanism with Robust Revocation in Cloud Computing · IEEE Trans. Serv. Comput. 2022

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

pairing-based cryptography · 1.1attribute-based encryption · 1.1
YearPublicationVenuePosition
2022 Server-Aided Fine-Grained Access Control Mechanism with Robust Revocation in Cloud Computing
abstract
As an innovative technique for cloud storage services, attribute based encryption (ABE) enables fine-grained access control over encrypted data in many cloud computing applications. However, there exist two main drawbacks that restrict the development of ABE. One is that most of the existing user revocation mechanisms cannot achieve high efficiency, immediacy and robustness simultaneously. Another is that the decryption of ABE contains expensive pairing operations which often grow with the complexity of access policy. In this work, we propose a practical server-aided revocable fine-grained access control mechanism with the help of cloud’s storage, computing and management capabilities, which not only achieves efficient fine-grained attribute based access control, but also actualizes immediate and robust user revocation. Moreover, most of the complicated operations in decryption are outsourced to the public cloud server, leaving one exponentiation for the users. At last, we implement our proposed mechanism with$\mathsf{Charm}$Charmframework. The benchmark results demonstrate the high efficiency and practicality of our proposed mechanism.
Hui Ma 0002, Rui Zhang 0002, Shuzhou Sun, Zishuai Song, Gaosheng Tan
IEEE Trans. Serv. Comput.5
2020 An Efficient CCA-Secure Access Control Encryption for Any Policy
Gaosheng Tan, Rui Zhang 0002, Hui Ma 0002, Yang Tao 0001
Inscrypt1