Proceedings of the 16th ACM Conference on Computer and Communications Security 2009
DOI: 10.1145/1653662.1653729
|View full text |Cite
|
Sign up to set email alerts
|

Mapping kernel objects to enable systematic integrity checking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
96
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 100 publications
(96 citation statements)
references
References 14 publications
0
96
0
Order By: Relevance
“…Searching overheads: In practice, searching for data structures in a kernel memory snapshot can take from tens of milliseconds [51] up to to several minutes [31]. Thus, most systems reduce overheads by searching periodically and asynchronously ( §IV-A).…”
Section: A Learning and Reconstructionmentioning
confidence: 99%
See 1 more Smart Citation
“…Searching overheads: In practice, searching for data structures in a kernel memory snapshot can take from tens of milliseconds [51] up to to several minutes [31]. Thus, most systems reduce overheads by searching periodically and asynchronously ( §IV-A).…”
Section: A Learning and Reconstructionmentioning
confidence: 99%
“…Kernel Object Pinpointer (KOP) [31] extended a fast aliasing analysis developed for non-security purposes [49], with several additional features, including: field-sensitivity, allowing KOP to differentiate accesses made to different fields within the same struct; context-sensitivity, differentiating different uses of union types and void pointers based on type information in code at the call sites; as well as inter-procedural and flow-insensitive analysis, rendering the analysis robust to conditional control flow, e.g., if statements. In applying the static analysis to a memory snapshot, KOP begins with global symbols and traverses all pointers in the identified data structures to generate a graph of kernel data structures.…”
Section: A Learning and Reconstructionmentioning
confidence: 99%
“…Prior work identifies data structures in memory by traversing pointers starting from program (kernel) global variables and following the points-to relationships to reach instances of the data structure. KOP [5], MAS [16], FATKIT [1] and VOLATILITY [3] all use such technique. While SIGPATH also leverages this approach the substantial difference is that these works require access to the target's source code or its data structure definitions in symbol files.…”
Section: Related Workmentioning
confidence: 99%
“…These data structures store private, often sensitive, data of interest such as running processes in an OS, unit and resource information in online games, and credentials and contact information in Instant Messengers (IM). Such capability is crucial for memory forensics [1][2][3][4], rootkit detection [5][6][7], game hacking [8], reverse engineering [9][10][11], and virtual machine introspection (VMI) [12].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation