Demo Data from EDBT 2026 / reviewers in the wild / expert
Deming Mao
dblp:225/1726
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0001-9368-1842ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 first-author · 1 since 2021Security 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 |
Systems and software security · 67% Cyber-physical and IoT security · 33% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cyber-physical and IoT security
industrial control system security |
1.0 | 1 | 2026 | CtrlFuzz: Control Field Aware Greybox Fuzzing for Public ICS Protocols Based on Expert System · IEEE Trans. Dependable Secur. Comput. 2026 |
Systems and software security › vulnerability discovery › fuzzing
protocol fuzzing |
1.0 | 1 | 2026 | CtrlFuzz: Control Field Aware Greybox Fuzzing for Public ICS Protocols Based on Expert System · IEEE Trans. Dependable Secur. Comput. 2026 |
Systems and software security
vulnerability discovery |
1.0 | 1 | 2026 | CtrlFuzz: Control Field Aware Greybox Fuzzing for Public ICS Protocols Based on Expert System · IEEE Trans. Dependable Secur. Comput. 2026 |
Program analysis
static analysis |
0.3 | 1 | 2026 | CtrlFuzz: Control Field Aware Greybox Fuzzing for Public ICS Protocols Based on Expert System · IEEE Trans. Dependable Secur. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
static analysis · 2.0greybox fuzzing · 2.0expert system · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | CtrlFuzz: Control Field Aware Greybox Fuzzing for Public ICS Protocols Based on Expert SystemabstractWith the development of information technology, the originally closed industrial control system (ICS) protocol has become more public. Existing protocol fuzzing techniques can be directly applied to public ICS protocols to discover their vulnerabilities. However, they do not consider how to obtain the complete ICS protocol message syntax and perform effective state-guided fuzzing based on this syntax. This causes a large number of generated test cases to fail the syntax checking of the ICS protocol program and are eventually discarded. In this paper, we propose CtrlFuzz, a control field aware protocol fuzzer for public ICS protocols. We find that most ICS protocol programs perform different processing based on the value of the control field when processing received messages. These messages with different control field values together constitute the complete ICS protocol message syntax. Based on the above observations, we propose an expert system-based extracting strategy for complete ICS protocol message syntax. Specifically, CtrlFuzz uses an expert system to identify and infer the control fields in ICS protocol messages. To narrow the scope of inference, CtrlFuzz uses static analysis techniques to extract specific values in the program as optional values of the control fields. Moreover, we propose a state-guided fuzzing strategy based on the inferred message syntax. Our evaluation shows that compared with the state-of-the-art protocol fuzzers AFLNET, BooFuzz, StateAFL and ChatAFL, CtrlFuzz improves branch coverage by 6.8%–10.9% and state coverage by 23.7%–147.4% on average within 24 hours. Moreover, CtrlFuzz has exposed a total of 4 unknown vulnerabilities, and all have been confirmed and fixed, with one assigned a CVE number. Lindong Peng, Hong-Fang Yu, Ting Chen 0002, Deming Mao, Xiaosong Zhang 0001 |
IEEE Trans. Dependable Secur. Comput. | 5 |
| 2021 | Anomaly Detection of Network Streams via Dense Subgraph DiscoveryabstractWe consider cyber security as one of the most significant technical challenges in current times. One of the main tasks is to detect anomalous patterns in the network streams as soon as they appear. In order to solve the above problem, previous propositions use statistical or machine learning-based methods to detect anomalous patterns in the network streams. However, these solutions incur significant low efficiency and precision due to the frequent recomputation of the results from scratch and unreasonable assumptions. In graph theory, dense subgraphs can be used to model the anomalous patterns if we abstract the network streams as a dynamic graph. This motivates us to explore dense subgraph discovery under the scenario where the network is updating. In this paper, we propose a graph-based framework, referred to as SAD, towards continuous dense subgraph discovery over network streams. In specific, we design an auxiliary data structure that is a concise representation of intermediate results, and its execution model allows a fast incremental maintenance strategy. In this way, we can detect anomalous patterns in the network streams in near real-time. Experiments demonstrate that SAD can not only get a higher accuracy of 90.2% but also faster than $11.4\times$ times compared to the state-of-the-art anomaly detection algorithms. Qianzhen Zhang, Deming Mao, Ziyue Lu, Deke Guo, Sheng Chen 0015 |
ICCCN | 3 |
| 2018 | Trusted Authority Assisted Three-Factor Authentication and Key Agreement Protocol for the Implantable Medical SystemabstractThe application of implantable medical devices (IMDs), which solves the problems of geographical distance limitation and real‐time health monitoring that plague patients and doctors, has caused great repercussions in the medical community. Despite the great potential of wide application, it also brings some security and privacy issues, such as the leakage of health data and unauthorized access to IMDs. Although a number of authentication and key agreement (AKA) schemes have been developed, we find that some subtle attacks still remain to be addressed. Then we propose an improved AKA scheme which achieves strong security features including user anonymity and known key security. It is formally proved to be secure under the Real‐or‐Random model. Moreover, a comprehensive security analysis shows that our scheme can resist various attacks and satisfy the desired requirements. Finally, the performance analysis shows the superiority of our protocol which is suitable for the implantable medical system. Deming Mao |
Wirel. Commun. Mob. Comput. | 1 |