A Heap of Trouble: Breaking the Linux Kernel SLOB Allocator
@inproceedings{Rosenberg2012AHO, title={A Heap of Trouble: Breaking the Linux Kernel SLOB Allocator}, author={Daniel Rosenberg}, year={2012} }
In this paper, we will systematically evaluate the implementation of the Linux kernel SLOB allocator to assess exploitability. We will present new techniques for attacking the SLOB allocator, whose exploitation has not been publicly described. These techniques will apply to exploitation scenarios that become progressively more constrained, starting with an arbitrarylength, arbitrary-contents heap overow and concluding with an o-by-one NULL byte overow.
No Paper Link Available
3 Citations
Optimizing Memory Usage in L4-Based Microkernel
- Computer ScienceComput. Informatics
- 2017
This paper presentserent memory management algorithms and their aplicability to an L4-based microkernel to reduce memory usage and increase the performance of allocation and deallocation of memory.
Evaluating Approaches for Detecting and Eliminating Memory Safety Errors in Linux Kernel Programming
- Computer Science
- 2019
XNU: a security evaluation
- Computer Science
- 2012
It is stated that the XNU kernel has many protection mechanisms in place, but that they could be improved to better protect against exploitation, and that the current design ofXNU, which consists of two separate compo- nents that heavily interact, is error prone and would bene�t from refactoring.
References
SHOWING 1-3 OF 3 REFERENCES
A Guide to Kernel Exploitation
- Attacking the Core. Syngress,
- 2010
Linux Kernel Heap Tampering Detection
A Guide to Kernel Exploitation: Attacking the Core
- 2010