• Corpus ID: 64312333

A Heap of Trouble: Breaking the Linux Kernel SLOB Allocator

@inproceedings{Rosenberg2012AHO,
  title={A Heap of Trouble: Breaking the Linux Kernel SLOB Allocator},
  author={D. 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
2 Citations
Highly Influential Citations
1
Background Citations
1

2 Citations

Citation Type

Citation Type

XNU: a security evaluation
TLDR
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.
Evaluating Approaches for Detecting and Eliminating Memory Safety Errors in Linux Kernel Programming

References

SHOWING 1-3 OF 3 REFERENCES
A Guide to Kernel Exploitation
  • Attacking the Core. Syngress,
  • 2010
A Guide to Kernel Exploitation: Attacking the Core
  • 2010
Linux Kernel Heap Tampering Detection