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

Dilxat Ghopur

dblp:364/6279 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-9045-1491ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Authentication and access control · 54% Cryptographic primitives and cryptanalysis · 46%
Computer networks
1 paper
Internet of things and sensor networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
iot security
1.012026
Forward secure bilateral access control for end-cloud collaborative Internet of Things · Sci. China Inf. Sci. 2026
Authentication and access control
access control
1.012026
Forward secure bilateral access control for end-cloud collaborative Internet of Things · Sci. China Inf. Sci. 2026
Authentication and access control › policy-based access control
bilateral access control
1.012026
Forward secure bilateral access control for end-cloud collaborative Internet of Things · Sci. China Inf. Sci. 2026
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.712023
Puncturable Key-Policy Attribute-Based Encryption Scheme for Efficient User Revocation · IEEE Trans. Serv. Comput. 2023
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
key-policy attribute-based encryption
0.712023
Puncturable Key-Policy Attribute-Based Encryption Scheme for Efficient User Revocation · IEEE Trans. Serv. Comput. 2023
Cryptographic primitives and cryptanalysis › encryption
puncturable encryption
0.712023
Puncturable Key-Policy Attribute-Based Encryption Scheme for Efficient User Revocation · IEEE Trans. Serv. Comput. 2023
Authentication and access control › identity management
user revocation
0.712023
Puncturable Key-Policy Attribute-Based Encryption Scheme for Efficient User Revocation · IEEE Trans. Serv. Comput. 2023
Cryptographic primitives and cryptanalysis › provable security › security notions
forward security
0.312026
Forward secure bilateral access control for end-cloud collaborative Internet of Things · Sci. China Inf. Sci. 2026
Cloud and datacenter computing › cloud security
cloud data security
0.212023
Puncturable Key-Policy Attribute-Based Encryption Scheme for Efficient User Revocation · IEEE Trans. Serv. Comput. 2023

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

puncturing · 1.3chosen-plaintext attack security proof · 1.3
YearPublicationVenuePosition
2026 Forward secure bilateral access control for end-cloud collaborative Internet of Things
Keyong Hong, Chuang Tian 0001, Dilxat Ghopur
Sci. China Inf. Sci.5
2025 Decentralized Multiauthority Attribute-Based Searchable Encryption for E-Health Cloud
abstract
Electronic medical records (EMRs) are the essential sensitive personal data that is shared between patients and doctors through the semi-trusted E-health cloud. In the real application, multiauthority ciphertext-policy attribute-based searchable encryption (MA-CP-ABSE) is suitable to protect the security of the EMR for it possesses fine-grained access permission, efficient key management, and retrieval function over the encrypted data. However, previously proposed MA-CP-ABSE schemes are commonly restricted by the central authority, which is required by all attribute authorities in some operations like generating users’ secret keys. To deal with this issue, we proposed a decentralized MA-CP-ABSE (DMA-CP-ABSE) scheme. In our scheme, any attribute authority can become an independent authority to generate a secret key, which is no longer controlled by the central authority. Furthermore, a single-keyword search will produce many disrelated search results. For this, we enhance the DMA-CP-ABMSE scheme by implementing a multikeyword search function to improve the search accuracy. Besides, to handle the dynamic changing of access permission, we have designed the attribute revocation methods. Finally, we process the formal security analysis to demonstrate our scheme is secure under the chosen-keyword attack (CKA) and implement experiments to show its efficiency and feasibility.
Dilxat Ghopur, Jianfeng Ma 0001, XinDi Ma, Kuizhi Liu, Tao Jiang 0017, Xiangyu Wang 0010
IEEE Internet Things J.1
2023 Puncturable Key-Policy Attribute-Based Encryption Scheme for Efficient User Revocation
abstract
Cloud computing, which provides a brand-new service model, has become an important infrastructure in the information age, and has been widely used in numerous fields. The Key-Policy Attribute-Based Encryption (KP-ABE) scheme allows the encrypted data with fine-grained access control in the cloud environment. However, achieving large-scale user revocation in the application scenario of KP-ABE becomes one of the thorny problems. Furthermore, the computation and communication costs of the previous user revocation schemes were generally high, especially when a large number of users were revoked. To address these problems, an enhanced high-performance user-revocable KP-ABE scheme combined with the puncture method was proposed. In this article, the user could be revoked by the fine-grained restriction policy. When revoking the user, the cloud would run the puncture algorithm to embed the restriction policy defined by the data owner into the ciphertext. This method could effectively omit the re-encryption and key updating processes, by which the computation and communication overhead of the user revocation are efficiently reduced, and the user revocation becomes more flexible and efficient. Moreover, the Chosen-Plaintext Attack (CPA) security proof and extensive simulation results demonstrate the reliability and efficiency of the proposed scheme for user revocation in a cloud environment.
Dilxat Ghopur, Jianfeng Ma 0001, XinDi Ma, Jialu Hao, Tao Jiang 0017, Xiangyu Wang 0010
IEEE Trans. Serv. Comput.1