Machine-Level Programming Advanced Topics Topics Buffer Overflow.

Slides:



Advertisements
Similar presentations
Buffer Overflows Nick Feamster CS 6262 Spring 2009 (credit to Vitaly S. from UT for slides)
Advertisements

Smashing the Stack for Fun and Profit
Exploring Security Vulnerabilities by Exploiting Buffer Overflow using the MIPS ISA Andrew T. Phillips Jack S. E. Tan Department of Computer Science University.
Communications of the ACM (CACM), Vol. 32, No. 6, June 1989
CSc 352 Programming Hygiene Saumya Debray Dept. of Computer Science The University of Arizona, Tucson
Machine-Level Programming V: Miscellaneous Topics Topics Buffer Overflow Linux Memory Layout Understanding Pointers Floating-Point Code CS 105 Tour of.
Today C operators and their precedence Memory layout
Carnegie Mellon 1 Machine-Level Programming V: Advanced Topics : Introduction to Computer Systems 8 th Lecture, Sep. 16, 2010 Instructors: Randy.
Machine-Level Programming V: Miscellaneous Topics Sept. 24, 2002 Topics Linux Memory Layout Understanding Pointers Buffer Overflow Floating Point Code.
Machine-Level Programming V: Miscellaneous Topics Topics Linux Memory Layout Buffer Overflow Floating Point Code CS213.
– 1 – EECS213, S’08 Alignment Aligned Data Primitive data type requires K bytes Address must be multiple of K Required on some machines; advised on IA32.
Fabián E. Bustamante, Spring 2007 Machine-Level Prog. V – Miscellaneous Topics Today Buffer overflow Floating point code Next time Memory.
Introduction to x86 Assembly or “How does someone hack my laptop?”
CSCE 815 Network Security Lecture 20 Intruders / Intrusion Detection April 3, 2003.
Security Exploiting Overflows. Introduction r See the following link for more info: operating-systems-and-applications-in-
Machine Programming – IA32 memory layout and buffer overflow CENG331: Introduction to Computer Systems 7 th Lecture Instructor: Erol Sahin Acknowledgement:
Carnegie Mellon 1 This week Buffer Overflow  Vulnerability  Protection.
1 UCR Common Software Attacks EE 260: Architecture/Hardware Support for Security Slide credits: some slides from Dave O’halloran, Lujo Bauer (CMU) and.
Fall 2008CS 334: Computer SecuritySlide #1 Smashing The Stack A detailed look at buffer overflows as described in Smashing the Stack for Fun and Profit.
Functions & Activation Records Recursion
IA32 Linux Memory Layout Stack Heap Data Text not drawn to scale FF
Buffer Overflow Computer Organization II 1 © McQuain Buffer Overflows Many of the following slides are based on those from Complete Powerpoint.
University of Washington Today Memory layout Buffer overflow, worms, and viruses 1.
Computer Security  x86 assembly  How did it go?  IceCTF  Lock picking  Survey to be sent out about lock picking sets  Bomblab  Nice job!
III:1 X86 Assembly – Buffer Overflow. III:2 Administrivia HW3 – skip the farmer game portion, moved to HW5  Due today HW4 – Endian swap in ASM and C.
Machine-Level Programming V: Miscellaneous Topics Topics Buffer Overflow Floating Point Code.
1 Machine-Level Programming V: Advanced Topics Andrew Case Slides adapted from Jinyang Li, Randy Bryant & Dave O’Hallaron.
Ithaca College 1 Machine-Level Programming IX Memory & buffer overflow Comp 21000: Introduction to Computer Systems & Assembly Lang Systems book chapter.
Machine-Level Programming V: Advanced Topics CS304
University of Washington Today Happy Monday! HW2 due, how is Lab 3 going? Today we’ll go over:  Address space layout  Input buffers on the stack  Overflowing.
Carnegie Mellon 1 Today Arrays  One-dimensional  Multi-dimensional (nested) Structures Buffer Overflow.
Smashing the Stack Overview The Stack Region Buffer Overflow
Buffer Overflows Many of the following slides are based on those from
Overflows & Exploits. In the beginning 11/02/1988 Robert Morris, Jr., a graduate student in Computer Science at Cornell, wrote an experimental, self-replicating,
Machine-Level Programming V: Miscellaneous Topics
What is exactly Exploit writing?  Writing a piece of code which is capable of exploit the vulnerability in the target software.
1 Understanding Pointers Buffer Overflow. 2 Outline Understanding Pointers Buffer Overflow Suggested reading –Chap 3.10, 3.12.
Carnegie Mellon 1 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Machine-Level Programming V: Buffer overflow Slides.
Machine-Level Programming V: Advanced Topics
Information Security - 2. A Stack Frame. Pushed to stack on function CALL The return address is copied to the CPU Instruction Pointer when the function.
Machine-Level Programming Advanced Topics Topics Linux Memory Layout Buffer Overflow.
Machine-Level Programming V: Miscellaneous Topics Feb 10, 2004 Topics Linux Memory Layout Understanding Pointers Buffer Overflow Floating Point Code class09.ppt.
Machine-Level Programming V: Miscellaneous Topics
CS 3214 Computer Systems Godmar Back Lecture 7. Announcements Stay tuned for Project 2 & Exercise 4 Project 1 due Sep 16 Auto-fail rule 1: –Need at least.
Machine-Level Programming V: Miscellaneous Topics Topics Linux Memory Layout Understanding Pointers Buffer Overflow Floating-Point Code CS 105 Tour of.
Machine-Level Programming Advanced Topics Topics Linux Memory Layout Understanding Pointers Buffer Overflow.
Machine-Level Programming V: Miscellaneous Topics Feb 6, 2003 Topics Linux Memory Layout Understanding Pointers Buffer Overflow Floating Point Code class09.ppt.
@Yuan Xue Worm Attack Yuan Xue Fall 2012.
Machine-Level Programming V: Miscellaneous Topics Topics Buffer Overflow Floating Point Code class09.ppt.
Carnegie Mellon 1 Machine-Level Programming V: Advanced Topics / : Introduction to Computer Systems 9 th Lecture, Sep. 25, 2012 Instructors:
1 Binghamton University Machine-Level Programming V: Advanced Topics CS220: Computer Systems II.
Carnegie Mellon 1 Machine-Level Programming V: Advanced Topics Slides courtesy of: Randy Bryant & Dave O’Hallaron.
Buffer Overflow Buffer overflows are possible because C doesn’t check array boundaries Buffer overflows are dangerous because buffers for user input are.
Machine-Level Programming V: Buffer overflow
Instructor: Fatma CORUT ERGİN
The Hardware/Software Interface CSE351 Winter 2013
Machine-Level Programming V: Miscellaneous Topics
Machine Language V: Miscellaneous Topics Sept. 25, 2001
Instructors: Gregory Kesden
Machine-Level Programming V: Miscellaneous Topics
Buffer overflows Buffer overflows are possible because C does not check array boundaries Buffer overflows are dangerous because buffers for user input.
Machine-Level Programming X Memory & buffer overflow Comp 21000: Introduction to Computer Systems & Assembly Lang Systems book chapter 3* * Modified.
Machine-Level Programming V: Advanced Topics
Machine Level Representation of Programs (IV)
Machine-Level Programming V: Miscellaneous Topics
Machine-Level Programming V: Miscellaneous Topics October 2, 2008
Machine-Level Programming V: Advanced Topics
Instructors: Majd Sakr and Khaled Harras
Machine-Level Programming X Memory & buffer overflow Comp 21000: Introduction to Computer Systems & Assembly Lang Systems book chapter 3* * Modified.
Machine-Level Programming V: Miscellaneous Topics
Presentation transcript:

Machine-Level Programming Advanced Topics Topics Buffer Overflow

– 2 – CMSC 313, F’09 Internet Worm and IM War November, 1988 Internet Worm attacks thousands of Internet hosts. How did it happen? July, 1999 Microsoft launches MSN Messenger (instant messaging system). MSN Messenger clients can access popular AOL Instant Messaging Service (AIM) servers AIM server AIM client AIM client MSN client MSN server

– 3 – CMSC 313, F’09 Internet Worm and IM War (cont.) August 1999 Mysteriously, Messenger clients can no longer access AIM servers. Microsoft and AOL begin the IM war: AOL changes server to disallow Messenger clients Microsoft makes changes to clients to defeat AOL changes. At least 13 such skirmishes. How did it happen? The Internet Worm and AOL/Microsoft War were both based on stack buffer overflow exploits! many Unix functions do not check argument sizes. allows target buffers to overflow.

– 4 – CMSC 313, F’09 String Library Code Implementation of Unix function gets() No way to specify limit on number of characters to read Similar problems with other Unix functions strcpy : Copies string of arbitrary length scanf, fscanf, sscanf, when given %s conversion specification /* gets() - Get a string from stdin */ char *gets(char *dest) { int c = getchar(); char *p = dest; while (c != EOF && c != '\n') { *p++ = c; c = getchar(); } *p = '\0';/* NULL terminate */ return dest; }

– 5 – CMSC 313, F’09 Vulnerable Buffer Code int main() { printf("Type a string:"); echo(); return 0; } /* Echo Line */ void echo() { char buf[4]; /* Way too small! */ gets(buf); puts(buf); }

– 6 – CMSC 313, F’09 unix>./bufdemo Type a string: Buffer Overflow Executions unix>./bufdemo Type a string: unix>./bufdemo Type a string: ABC Segmentation Fault

– 7 – CMSC 313, F’09 Buffer Overflow Disassembly f0 : 80484f0:55 push %ebp 80484f1:89 e5 mov %esp,%ebp 80484f3:53 push %ebx 80484f4:8d 5d f8 lea 0xfffffff8(%ebp),%ebx 80484f7:83 ec 14 sub $0x14,%esp 80484fa:89 1c 24 mov %ebx,(%esp) 80484fd:e8 ae ff ff ff call 80484b :89 1c 24 mov %ebx,(%esp) :e8 8a fe ff ff call a:83 c4 14 add $0x14,%esp d:5b pop %ebx e:c9 leave f:c3 ret 80485f2:e8 f9 fe ff ff call 80484f f7:8b 5d fc mov 0xfffffffc(%ebp),%ebx 80485fa:c9 leave 80485fb:31 c0 xor %eax,%eax 80485fd:c3 ret

– 8 – CMSC 313, F’09 Buffer Overflow Stack echo: pushl %ebp# Save %ebp on stack movl %esp, %ebp pushl %ebx# Save %ebx leal -8(%ebp),%ebx# Compute buf as %ebp-8 subl $20, %esp# Allocate stack space movl %ebx, (%esp)# Push buf on stack call gets# Call gets... /* Echo Line */ void echo() { char buf[4]; /* Way too small! */ gets(buf); puts(buf); } Return Address Saved %ebp %ebp Stack Frame for main Stack Frame for echo [3][2][1][0] buf Saved %ebx

– 9 – CMSC 313, F’09 Buffer Overflow Stack Example unix> gdb bufdemo (gdb) break echo Breakpoint 1 at 0x (gdb) run Breakpoint 1, 0x in echo () (gdb) print /x $ebp $1 = 0xbfffc638 (gdb) print /x *(unsigned *)$ebp $2 = 0xbfffc658 (gdb) print /x *((unsigned *)$ebp + 1) $3 = 0x80485f f2:call 80484f f7:mov 0xfffffffc(%ebp),%ebx # Return Point Return Address Saved %ebp %ebp Stack Frame for main Stack Frame for echo [3][2][1][0] buf Saved %ebx Before call to gets 0xbfffc638 Return Address Saved %ebp Stack Frame for main Stack Frame for echo bfffc f7 xx buf 0xbfffc658 Saved %ebx

– 10 – CMSC 313, F’09 Buffer Overflow Example #1 Input = “ ” Overflow buf, but no problem 0xbfffc638 Return Address Saved %ebp Stack Frame for main Stack Frame for echo bfffc f buf xbfffc658 Before Call to gets 0xbfffc638 Return Address Saved %ebp Stack Frame for main Stack Frame for echo bfffc f7 xx buf 0xbfffc658 Saved %ebx

– 11 – CMSC 313, F’09 Buffer Overflow Stack Example #2 Input = “ ” a:83 c4 14 add $0x14,%esp # deallocate space d:5b pop %ebx # restore %ebx e:c9 leave # movl %ebp, %esp; popl %ebp f:c3 ret # Return end of echo code: Saved value of %ebp set to 0xbfffc600 echo code restores %ebp with corrupted value 0xffffc638 Return Address Saved %ebp Stack Frame for main Stack Frame for echo bfffc buf xbfffc600 %ebp 0xbfffc658

– 12 – CMSC 313, F’09 Example #2 Failure Input = “ ” 80485f2:e8 f9 fe ff ff call 80484f f7:8b 5d fc mov 0xfffffffc(%ebp),%ebx # bad ref? 80485fa:c9 leave # movl %ebp,%esp; popl %ebp 80485fb:31 c0 xor %eax,%eax 80485fd:c3 ret # bad ref Return from echo: echo code restores %ebp with corrupted value Subsequent references based on %ebp invalid Stack Frame for main 0xbfffc600 xx %ebp %esp 0xbfffc658

– 13 – CMSC 313, F’09 Buffer Overflow Stack Example #3 Input = “ ABC ” 0xbfffc638 Return Address Saved %ebp Stack Frame for main Stack Frame for echo buf xbfffc f2:call 80484f f7:mov 0xfffffffc(%ebp),%ebx # Return Point Invalid address No longer pointing to desired return point Return address Before Call to gets 0xbfffc638 Return Address Saved %ebp Stack Frame for main Stack Frame for echo bfffc xx buf 0xbfffc658 Saved %ebx

– 14 – CMSC 313, F’09 Example #3 Failure Input = “ ABC ” 0xbfffc638 Return Address Saved %ebp Stack Frame for main Stack Frame for echo buf xbfffc658 xx a:83 c4 14 add $0x14,%esp # deallocate space d:5b pop %ebx # restore %ebx e:c9 leave # movl %ebp, %esp; popl %ebp f:c3 ret # Return (Invalid) end of echo code: 0x Return address

– 15 – CMSC 313, F’09 Malicious Use of Buffer Overflow Input string contains byte representation of executable code Overwrite return address with address of buffer When bar() executes ret, will jump to exploit code at B int bar() { char buf[64]; gets(buf);... return...; } void foo(){ bar();... } Stack after call to gets() B return address A foo stack frame bar stack frame B exploit code pad data written by gets() Return address

– 16 – CMSC 313, F’09 Exploits Based on Buffer Overflows Buffer overflow bugs allow remote machines to execute arbitrary code on victim machines. Internet worm Early versions of the finger server (fingerd) used gets() to read the argument sent by the client: finger Worm attacked fingerd server by sending phony argument: finger “exploit-code padding new-return-address” exploit code: executed a root shell on the victim machine with a direct TCP connection to the attacker.

– 17 – CMSC 313, F’09 Exploits Based on Buffer Overflows Buffer overflow bugs allow remote machines to execute arbitrary code on victim machines. IM War AOL exploited existing buffer overflow bug in AIM clients exploit code: returned 4-byte signature (the bytes at some location in the AIM client) to server. When Microsoft changed code to match signature, AOL changed signature location.

– 18 – CMSC 313, F’09 Date: Wed, 11 Aug :30: (PDT) From: Phil Bucking From: Phil Bucking Subject: AOL exploiting buffer overrun bug in their own software! To: Mr. Smith, I am writing you because I have discovered something that I think you might find interesting because you are an Internet security expert with experience in this area. I have also tried to contact AOL but received no response. I am a developer who has been working on a revolutionary new instant messaging client that should be released later this year.... It appears that the AIM client has a buffer overrun bug. By itself this might not be the end of the world, as MS surely has had its share. But AOL is now *exploiting their own buffer overrun bug* to help in its efforts to block MS Instant Messenger..... Since you have significant credibility with the press I hope that you can use this information to help inform people that behind AOL's friendly exterior they are nefariously compromising peoples' security. Sincerely, Phil Bucking Founder, Bucking Consulting It was later determined that this originated from within Microsoft!

– 19 – CMSC 313, F’09 Code Red Worm History June 18, Microsoft announces buffer overflow vulnerability in IIS Internet server July 19, over 250,000 machines infected by new virus in 9 hours White house must change its IP address. Pentagon shut down public WWW servers for day When We Set Up Texbook Web Site Received strings of form GET /default.ida?NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN.... NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN%u9090%u6858%uc bd3%u7801%u9090%u6858%ucbd3%u7801%u9090%u6858%ucbd3%u780 1%u9090%u9090%u8190%u00c3%u0003%u8b00%u531b%u53ff%u0078% u0000%u00=a HTTP/1.0" "-" "-"

– 20 – CMSC 313, F’09 Code Red Exploit Code Starts 100 threads running Spread self Generate random IP addresses & send attack string Between 1st & 19th of month Attack Send 98,304 packets; sleep for 4-1/2 hours; repeat »Denial of service attack Between 21st & 27th of month Deface server’s home page After waiting 2 hours

– 21 – CMSC 313, F’09 Code Red Effects Later Version Even More Malicious Code Red II As of April, 2002, over 18,000 machines infected Still spreading Paved Way for NIMDA Variety of propagation methods One was to exploit vulnerabilities left behind by Code Red II ASIDE (security flaws start at home).rhosts used by Internet Worm Attachments used by MyDoom (1 in 6 s Monday morning!)

– 22 – CMSC 313, F’09 Avoiding Overflow Vulnerability Use Library Routines that Limit String Lengths fgets instead of gets strncpy instead of strcpy Don’t use scanf with %s conversion specification Use fgets to read the string Or use %ns where n is a suitable integer /* Echo Line */ void echo() { char buf[4]; /* Way too small! */ fgets(buf, 4, stdin); puts(buf); }

– 23 – CMSC 313, F’09 System-Level Protections unix> gdb bufdemo (gdb) break echo (gdb) run (gdb) print /x $ebp $1 = 0xffffc638 (gdb) run (gdb) print /x $ebp $2 = 0xffffbb08 (gdb) run (gdb) print /x $ebp $3 = 0xffffc6a8 Randomized stack offsets At start of program, allocate random amount of space on stack Makes it difficult for hacker to predict beginning of inserted code Random “signatures”  Place known values at specified stack locations. Check after function calls. Nonexecutable code segments In traditional x86, can mark region of memory as either “read-only” or “writeable” Can execute anything readable Add explicit “execute” permission

– 24 – CMSC 313, F’09 Suggested Reading “Smashing the Stack for Fun And Profit” “Smashing the Stack for Fun And Profit” By Elias Levy (aka Aleph One)Elias Levy Phrack Magazine, issue #49, 1996

– 25 – CMSC 313, F’09 Final Observations Working with Strange Code Important to analyze nonstandard cases E.g., what happens when stack corrupted due to buffer overflow Helps to step through with GDB