EDBT 2026 Demo / reviewers in the wild / expert
Man-Ni Hsu
dblp:413/6398
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 first-author · 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% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security
attack surface reduction |
0.9 | 1 | 2025 | CASE: Minimizing Attack Surfaces Based on Context-Aware System Call Enforcement · IEEE Trans. Serv. Comput. 2025 |
Systems and software security › operating system security
system call protection |
0.9 | 1 | 2025 | CASE: Minimizing Attack Surfaces Based on Context-Aware System Call Enforcement · IEEE Trans. Serv. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
return address validation · 0.9backward function call path validation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CASE: Minimizing Attack Surfaces Based on Context-Aware System Call EnforcementabstractInvoking system calls in exploit implementation is a typical approach to compromising a system. A key objective of these attacks is to manipulate program execution paths, with a specific focus on invoking targeted system calls. Our study introduces Context-Aware System Call Enforcement (CASE), a software-based approach meticulously crafted to shrink the attack surface associated with system call-based exploits. CASE achieves this by rigorously validating the context, mainly backward function call paths and runtime stack states, to ensure the legitimacy of system call invocations. Our strategy incorporates innovative elements, including anchored entry points, return address-based validation, and frame size checks. We formalize our approach by creating NP-hard challenges for potential attackers and complete with a proof-of-concept (PoC) implementation that shields against attacks. Our PoC implementation introduces minimal overhead, less than 2%, for context validation. Simultaneously, it adeptly identifies and halts attacks of varying complexities, ranging from simple examples to realworld servers. Man-Ni Hsu, Tsung-Han Liu, Hsuan-Ying Lee, Chun-Ying Huang |
IEEE Trans. Serv. Comput. | 1 |