Demo Data from EDBT 2026 / reviewers in the wild / expert
Duoming Zhou
dblp:352/6510
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0003-6507-828XORCID · reported
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 |
Systems and software security · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Concurrent programming · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security
exploitation |
0.7 | 1 | 2023 | When Top-down Meets Bottom-up: Detecting and Exploiting Use-After-Cleanup Bugs in Linux Kernel · SP 2023 |
Systems and software security › operating system security
kernel vulnerability detection |
0.7 | 1 | 2023 | When Top-down Meets Bottom-up: Detecting and Exploiting Use-After-Cleanup Bugs in Linux Kernel · SP 2023 |
Systems and software security
operating system security |
0.7 | 1 | 2023 | When Top-down Meets Bottom-up: Detecting and Exploiting Use-After-Cleanup Bugs in Linux Kernel · SP 2023 |
Concurrent programming
concurrency bugs |
0.2 | 1 | 2023 | When Top-down Meets Bottom-up: Detecting and Exploiting Use-After-Cleanup Bugs in Linux Kernel · SP 2023 |
Methods — techniques the papers use, named apart from their topics
routine switch point algorithm · 1.3pseudoterminal-based device emulation · 1.3points-to analysis · 1.3context- and flow-sensitive inter-procedural analysis · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | When Top-down Meets Bottom-up: Detecting and Exploiting Use-After-Cleanup Bugs in Linux KernelabstractWhen a device is detached from the system, Use-After-Cleanup (UAC) bugs can occur because a running kernel thread may be unaware of the device detachment and attempt to use an object that has been released by the cleanup thread. Our investigation suggests that an attacker can exploit the UAC bugs to obtain the capability of arbitrary code execution and privilege escalation, which receives little attention from the community. While existing tools mainly focus on well-known concurrency bugs like data race, few target UAC bugs.In this paper, we propose a tool named UACatcher to systematically detect UAC bugs. UACatcher consists of three main phases. It first scans the entire kernel to find target layers. Next, it adopts the context- and flow-sensitive inter-procedural analysis and the points-to analysis to locate possible free (deallocation) sites in the bottom-up cleanup thread and use (dereference) sites in the top-down kernel thread that can cause UAC bugs. Then, UACatcher uses the routine switch point algorithm which counts on the synchronizations and path constraints to detect UAC bugs among these sites and estimate exploitable ones. For exploitable bugs, we leverage the pseudoterminal-based device emulation technique to develop practical exploits.We have implemented a prototype of UACatcher and evaluated it on 5.11 Linux kernel. As a result, our tool successfully detected 346 UAC bugs, which were reported to the community (277 have been confirmed and fixed and 15 CVEs have been assigned). Additionally, 13 bugs are exploitable, which can be used to develop working exploits that gain the arbitrary code execution primitive in kernel space and achieve the privilege escalation. Finally, we discuss UACatcher’s limitations and propose possible solutions to fix and prevent UAC bugs. Lin Ma 0009, Duoming Zhou, Hanjie Wu, Yajin Zhou, Lei Wu 0012, Kui Ren 0001 |
SP | 2 |