Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhenjia Xiao
dblp:419/1008
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—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 |
Authentication and access control · 100% | |
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Authentication and access control
password authentication |
0.9 | 1 | 2025 | Improving Password Guessing With Isomorphism Modeling · IEEE Trans. Inf. Forensics Secur. 2025 |
Authentication and access control
password guessing |
0.9 | 1 | 2025 | Improving Password Guessing With Isomorphism Modeling · IEEE Trans. Inf. Forensics Secur. 2025 |
Methods — techniques the papers use, named apart from their topics
probabilistic context-free grammar · 1.7markov model · 1.7graph isomorphism network · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Improving Password Guessing With Isomorphism ModelingabstractPasswords remain one of the most widely used forms of authentication in modern systems. However, their inherent predictability, stemming from common user behaviors in password creation, renders password-based authentication vulnerable to guessing attacks. To balance memorability and security, users often construct isomorphic variants of a base password by altering its structure, such as transforming 123abc into 1a2b3c. These variants pose significant challenges to traditional password guessing models. In particular, mainstream approaches such as Markov model and Probabilistic Context-Free Grammar (PCFG) model struggle to capture the structural relationships among these variants. To address this challenge, we propose PassGIN, a password guessing framework based on Graph Isomorphism Networks (GIN). By modeling a password as a graph, PassGIN captures both local adjacency and character rearrangement patterns, enabling the model to distinguish subtle structural differences between base passwords and their isomorphic variants. To further enhance performance, we introduce PassCluster, a dynamic edge-weighting mechanism that leverages adjacency frequencies observed in large-scale password datasets. This allows GIN to more effectively learn structural variations and generate accurate guesses. Extensive experiments on eight real-world datasets demonstrate that PassGIN consistently outperforms state-of-the-art models in both intra-site and cross-site password guessing scenarios, achieving relative improvements of 23.49% and 74.53%, respectively. Zhenjia Xiao, Kaiwen Xing, Tao Yang 0015, Kaitai Liang, Hu Xiong |
IEEE Trans. Inf. Forensics Secur. | 2 |