heap exploitation heap primitives
play

Heap Exploitation Heap Primitives malloc free calloc - PowerPoint PPT Presentation

Heap Exploitation Heap Primitives malloc free calloc Organization of chunks Bins Fast Singly linked list 16, 24, 32, 40, 48, 56, 64, 72, 80 and 88 bytes Small Doubly linked list 16, 24, ... , 504 bytes


  1. Heap Exploitation

  2. Heap Primitives • malloc • free • calloc

  3. Organization of chunks • Bins • Fast • Singly linked list • 16, 24, 32, 40, 48, 56, 64, 72, 80 and 88 bytes • Small • Doubly linked list • 16, 24, ... , 504 bytes • Large • Doubly linked lists • Different sizes • Sorted in decreasing order • Unsorted

  4. Overview of Algorithms for malloc and free • Malloc • Free

  5. Examples of exploits • LIFO Experiment • Use after free • Unlink

  6. FIFO Experiment

  7. Example of UAF Heap exploit Indian Institute of Science 11

  8. Example of UAF Heap exploit Indian Institute of Science 12

  9. Example of UAF Heap exploit Indian Institute of Science 13

  10. Example of UAF Heap exploit Indian Institute of Science 14

  11. Example of UAF Heap exploit Indian Institute of Science 15

  12. Example of UnLink Exploit

  13. Example of UnLink Exploit

  14. Current Research: Attackers Perspective • Automatic manipulation • Dynamic and static analysis • Understanding allocators • Chunk placement • Manual Exploitation: Exploit writing

Recommend


More recommend