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

Dengqi Yang

dblp:53/10848 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · unresolved

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

Computer networks · 1 · 1 since 2021Security and privacy · 1

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
Authentication and access control · 56% Cryptographic protocols and secure computation · 44%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key exchange
authenticated key exchange
0.412019
Comments on "Provably Secure Dynamic Id-Based Anonymous Two-Factor Authenticated Key Exchange Protocol With Extended Security Model" · IEEE Trans. Inf. Forensics Secur. 2019
Cryptographic protocols and secure computation › key exchange › authenticated key exchange
password-authenticated key exchange
0.412019
Comments on "Provably Secure Dynamic Id-Based Anonymous Two-Factor Authenticated Key Exchange Protocol With Extended Security Model" · IEEE Trans. Inf. Forensics Secur. 2019
Authentication and access control › user authentication
smart card authentication
0.412019
Comments on "Provably Secure Dynamic Id-Based Anonymous Two-Factor Authenticated Key Exchange Protocol With Extended Security Model" · IEEE Trans. Inf. Forensics Secur. 2019
Authentication and access control › multi-factor authentication
two-factor authentication
0.412019
Comments on "Provably Secure Dynamic Id-Based Anonymous Two-Factor Authenticated Key Exchange Protocol With Extended Security Model" · IEEE Trans. Inf. Forensics Secur. 2019
Authentication and access control
dictionary attack
0.112019
Comments on "Provably Secure Dynamic Id-Based Anonymous Two-Factor Authenticated Key Exchange Protocol With Extended Security Model" · IEEE Trans. Inf. Forensics Secur. 2019
Authentication and access control › dictionary attack
offline dictionary attack
0.112019
Comments on "Provably Secure Dynamic Id-Based Anonymous Two-Factor Authenticated Key Exchange Protocol With Extended Security Model" · IEEE Trans. Inf. Forensics Secur. 2019
YearPublicationVenuePosition
2026 WLCHAT-PDP: Provable Data Possession Based on Weighted Link-List Chameleon Hash Authentication Tree in Edge Computing
abstract
In Internet of Things (IoT) scenarios, the integrity audit of massive amounts of data uploaded from Edge Nodes (ENs) to the cloud poses significant challenge to researchers. Existing Provable Data Possession (PDP) schemes suffer from low communication and computational efficiency, as well as the issue of Third-Party Auditors (TPAs) not being completely trustworthy, especially in dynamic data update scenarios. This paper designs an efficient authentication structure, named the Weighted Link-list Chameleon Hash Authentication Tree (WLCHAT), to reduce cloud storage overhead and improve dynamic update efficiency. Based on this, the paper further proposes the WLCHAT-PDP scheme, which is built upon the WLCHAT structure. Building on the PDP model, the proposed scheme introduces the ENs to proxy user operations for tag generation and to participate in the audit process. By combining this with a user authorization signature mechanism, the proposed scheme not only alleviates terminal computational load but also guarantees that all operations are authorized. To enhance the credibility of the audit process, the proposed scheme incorporates blockchain-anchored log records to effectively prevent collusive behavior between cloud service providers and TPAs. Theoretical analyses and comparative evaluation demonstrate that the scheme achieves a balance between security and computational overhead, rendering it suitable for dynamic and trusted IoT cloud storage environments.
Youjun Xu, Yiyu Yang, Dengqi Yang, Chengzhe Lai
Peer Peer Netw. Appl.5
2019 Comments on "Provably Secure Dynamic Id-Based Anonymous Two-Factor Authenticated Key Exchange Protocol With Extended Security Model"
abstract
Password-based authenticated key exchange (PAKE) protocol has been widely used in practice, since it is convenient for users. However, the easy-to-remember property of the password also brings security problem. In this paper, we show there is an off-line dictionary attack in an efficient PAKE protocol when the smart card is lost. In order to resist the attack, we give a countermeasure to improve it. The countermeasure makes a simple change to the original protocol which does not affect the efficiency of the protocol.
Xiaowei Li 0001, Dengqi Yang, Xing Zeng, Benhui Chen, Yuqing Zhang 0001
IEEE Trans. Inf. Forensics Secur.2