Chapter 10 Flashcards

buffer overflow

1
Q

Buffer overflow

A

more input can be placed into buffer /data holding area than capacity allocated, overwriting other info-crash system /gain control

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Consequences

A
  1. corruption
  2. transfer of control
  3. memory access violations
  4. execution of code
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Needs for buffer overflow attack

A
  1. identify buffer overflow vulnerability in program
  2. understand how buffer stored in memory
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Attacks

A
  1. stack buffer overflows
  2. Shellcode -code from attacker
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

eax

A

arithmetical + IO operations + interrupt calls

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

ebx

A

base register - access memory , pass system call arguments + return values

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

ecx

A

count register

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

edx

A

arithmetic, interrupt calls , IO operations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

ebp

A

base pointer - address of current stack frame

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

eip

A

instruction pointer - address of next instruction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

esi

A

source index - pointer for string /array operations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

esp

A

stack pointer - address of top of stack

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Defenses - compile time

A

harden programs to resist attacks
1. high-level language
2. safe coding techniques
3. safe libraries
4. stack protection - function entry + exit code
- entry write copy of return address in safe space in memory
- exit check return address in stack against saved

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Defences - run time

A
  1. executable address space protection
  2. address space randomization
  3. Guard pages - page between critical portions in memory
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

replacement stack frame

A

way to get control using dummy stack frame

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Other attacks

A
  1. replacement stack frame
  2. global data overflow
  3. heap overflow
  4. return to system call - replace return address with library