Building Dynamic System Call Sandbox with Partial Order Analysis
summary
Builds a runtime system-call sandbox called DBox that instruments program binaries to gradually disable system calls at identified reduction points using partial order analysis. It uses a candidate graph, maps nodes to a partially ordered graph, and leverages angr and a preprocessing step to map library interfaces to syscalls and insert seccomp calls via ccom. Evaluated on seven apps (~615 KLOC), DBox blocks 83.42% of 1,726 payloads, reduces allowed syscalls by +23.50/+16.86/+15.89 versus Chestnut/Temporal/C2C, with 5.07% average overhead.
AI-written summary · about
chapters (7)
- 0:00Dynamic sandboxing intro
- 2:11Policy adjustment lifecycle
- 5:26Partial order analysis
- 7:34Candidate and graph building
- 12:50StandBox evaluation results
- 14:58Conclusion and future work
- 15:21Q&A
related talks
22mPrivbox: Faster System Calls Through Sandboxed Privileged Execution
17mAutomated Policy Synthesis for System Call Sandboxing
35mEnter Sandbox
38mSandboxing in Linux with zero lines of code
01h 25mSandboxing a Linux Application
11mPlaying in the Sandbox: A Study on the Usability of Seccomp
26mSyscall Me by Your Name: Sandboxing Wasm Programs
43mSandboxes, Seccomp, and Syscalls: Chasing Isolation in Kubernetes (Mark Manning)
