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

Wanying Qin

dblp:436/2734 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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 protocols and secure computation · 77% Authentication and access control · 23%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management › key distribution
group key distribution
1.012026
ChatKID: Identity-Based Group Key Distribution Protocol for Instant Messaging · IEEE Trans. Dependable Secur. Comput. 2026

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

polynomial-based key derivation · 1.0SM9 · 1.0
YearPublicationVenuePosition
2026 ChatKID: Identity-Based Group Key Distribution Protocol for Instant Messaging
abstract
With the growing demand for instant messaging, securing group chats has become a critical concern. While cryptographic approaches are essential for this purpose, they typically require secure and efficient protocols for either group key agreement or group key distribution. Most existing solutions struggle to achieve efficient key updates and seamless integration with real-world systems. To address these limitations, we We present ChatKID, an identity-based group key distribution protocol. At the architectural level, ChatKID employs an asymmetric design to address the resource imbalance between the group owner and group members in group key distribution. At the technical level, it develops a novel polynomial-based key derivation method that drastically improves key update efficiency, while its compliance with the SM9 cryptographic standard enables easy integration with numerous systems. We provide formal analyses of correctness and security, including resilience against five common attacks (e.g., man-in-the-middle, replay), and achieve forward and backward secrecy. Subsequently, we compare ChatKID with recent protocols and demonstrate its significant advantages in both storage and communication overhead. Notably, for group members—typically resource-constrained mobile devices—ChatKID reduces overhead by one to two orders of magnitude (i.e., to$1/10\sim 1/100$) compared to others. Furthermore, we compare ChatKID with mainstream instant messaging applications and demonstrate advantages in terms of connection dependency, computational overhead, communication overhead, and storage requirements. Finally, simulation experiments indicate its superior performance in typical instant messaging scenarios. Taken together, these results suggest that ChatKID holds significant promise for advancing group key distribution in real-world instant messaging applications.
Jiayimei Wang, Wanying Qin, Jiaming Wen 0001
IEEE Trans. Dependable Secur. Comput.3