Heap Exploitation Heap Primitives malloc free calloc - - PowerPoint PPT Presentation

heap exploitation heap primitives
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 1

Heap Exploitation

slide-2
SLIDE 2
slide-3
SLIDE 3

Heap Primitives

  • malloc
  • free
  • calloc
slide-4
SLIDE 4
slide-5
SLIDE 5
slide-6
SLIDE 6
slide-7
SLIDE 7

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
slide-8
SLIDE 8

Overview of Algorithms for malloc and free

  • Malloc
  • Free
slide-9
SLIDE 9

Examples of exploits

  • LIFO Experiment
  • Use after free
  • Unlink
slide-10
SLIDE 10

FIFO Experiment

slide-11
SLIDE 11

Example of UAF Heap exploit

Indian Institute of Science 11

slide-12
SLIDE 12

Example of UAF Heap exploit

Indian Institute of Science 12

slide-13
SLIDE 13

Example of UAF Heap exploit

Indian Institute of Science 13

slide-14
SLIDE 14

Example of UAF Heap exploit

Indian Institute of Science 14

slide-15
SLIDE 15

Example of UAF Heap exploit

Indian Institute of Science 15

slide-16
SLIDE 16

Example of UnLink Exploit

slide-17
SLIDE 17

Example of UnLink Exploit

slide-18
SLIDE 18
slide-19
SLIDE 19

Current Research: Attackers Perspective

  • Automatic manipulation
  • Dynamic and static analysis
  • Understanding allocators
  • Chunk placement
  • Manual Exploitation: Exploit writing