DOCSLIB.ORG

Buffer Overflows

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Buffer Overflows Buffer Overflows: Attacks and Defenses for the Vulnerability of the Decade* Crispin Cowan, Perry Wagle, Calton Pu, Steve Beattie, and Jonathan Walpole Department of Computer Science and Engineering Oregon Graduate Institute of Science & Technology ([email protected]) http://www.cse.ogi.edu/DISC/projects/immunix Abstract bility presents the attacker with exactly what they need: Buffer overflows have been the most common the ability to inject and execute attack code. The form of security vulnerability for the last ten injected attack code runs with the privileges of the vul- years. More over, buffer overflow vulnerabilities nerable program, and allows the attacker to bootstrap dominate the area of remote network penetra- whatever other functionality is needed to control tion vulnerabilities, where an anonymous Inter- (“own” in the underground vernacular) the host com- net user seeks to gain partial or total control of puter. a host. If buffer overflow vulnerabilities could be effectively eliminated, a very large portion of For instance, among the five “new” “remote to the most serious security threats would also be local” attacks used in the 1998 Lincoln Labs intrusion eliminated. In this paper, we survey the various detection evaluation, three were essentially social engi- types of buffer overflow vulnerabilities and neering attacks that snooped user credentials, and two attacks, and survey the various defensive mea- were buffer overflows. 9 of 13 CERT advisories from sures that mitigate buffer overflow vulnerabili- 1998 involved buffer overflows [34] and at least half of ties, including our own StackGuard method. We 1999 CERT advisories involve buffer overflows [5]. An then consider which combinations of techniques informal survey on the Bugtraq security vulnerability can eliminate the problem of buffer overflow mailing list [29] showed that approximately 2/3 of vulnerabilities, while preserving the functional- respondents felt that buffer overflows are the leading ity and performance of existing systems. cause of security vulnerability.1 1 Introduction Buffer overflow vulnerabilities and attacks come in Buffer overflows have been the most common form a variety of forms, which we describe and classify in Section 2. Defenses against buffer overflow attacks of security vulnerability in the last ten years. More similarly come in a variety of forms, which we describe over, buffer overflow vulnerabilities dominate in the in Section 3, including which kinds of attacks and vul- area of remote network penetration vulnerabilities, nerabilities these defenses are effective against. The where an anonymous Internet user seeks to gain partial Immunix project has developed the StackGuard defen- or total control of a host. Because these kinds of attacks enable anyone to take total control of a host, they repre- sive mechanism [14, 11], which has been shown to be highly effective at resisting attacks without compromis- sent one of the most serious classes security threats. ing system compatibility or performance [9]. Section 4 Buffer overflow attacks form a substantial portion discusses which combinations of defenses complement of all security attacks simply because buffer overflow each other. Section 5 presents our conclusions. vulnerabilities are so common [15] and so easy to exploit [30, 28, 35, 20]. However, buffer overflow vul- 2 Buffer Overflow Vulnerabilities and nerabilities particularly dominate in the class of remote penetration attacks because a buffer overflow vulnera- Attacks The overall goal of a buffer overflow attack is to *. This work supported in part by DARPA grant F30602-96-1- subvert the function of a privileged program so that the 0331, and DARPA contract DAAH01-99-C-R206. attacker can take control of that program, and if the pro- gram is sufficiently privileged, thence control the host. (c) Copyright 1999 IEEE. Reprinted, with permission, from Typically the attacker is attacking a root program, and Proceedings of DARPA Information Survivability immediately executes code similar to “exec(sh)” to get Conference and Expo (DISCEX), http:// a root shell, but not always. To achieve this goal, the schafercorp-ballston.com/discex/ attacker must achieve two sub-goals: To appear as an invited talk at SANS 2000 (System 1.The remaining 1/3 of respondants identified Administration and Network Security), http:// “misconfiguration” as the leading cause of security www.sans.org/newlook/events/sans2000.htm vulnerability. — 1 — 1. Arrange for suitable code to be available in the pro- weak or non-existent bounds checking on its input with gram's address space. a goal of corrupting the state of an adjacent part of the 2. Get the program to jump to that code, with suitable program’s state, e.g. adjacent pointers, etc. By over- parameters loaded into registers & memory. flowing the buffer, the attacker can overwrite the adja- cent program state with a near-arbitrary2 sequence of We categorize buffer overflow attacks is in terms of bytes, resulting in an arbitrary bypass of C’s type sys- achieving these two sub-goals. Section 2.1 describes tem3 and the victim program’s logic. how the attack code is placed in the victim program’s address space (which is where the “buffer” part comes The classification here is the kind of program state that the attacker’s buffer overflow seeks to corrupt. In from). Section 2.2 describes how the attacker overflows principle, the corrupted state can be any kind of state. a program buffer to alter adjacent program state (which For instance, the original Morris Worm [37] used a is where the “overflow” part comes from) to induce the buffer overflow against the program to cor- victim program to jump to the attack code. Section 2.3 fingerd rupt the name of a file that would execute. In discusses some issues in combining the code injection fingerd techniques from Section 2.1 with the control flow cor- practice, most buffer overflows found in “the wild” seek to corrupt code pointers: program state that points ruption techniques from Section 2.2. at code. The distinguishing factors among buffer over- flow attacks is the kind of state corrupted, and where in 2.1 Ways to Arrange for Suitable Code to Be in the memory layout the state is located. the Program's Address Space Activation Records: Each time a function is called, it There are two ways to arrange for the attack code to lays down an activation record on the stack [1] that be in the victim program’s address space: either inject includes, among other things, the return address that it, or use what is already there. the program should jump to when the function exits, Inject it: The attacker provides a string as input to the i.e. point at the code injected in Section 2.1. Attacks program, which the program stores in a buffer. The that corrupt activation record return addresses over- string contains bytes that are actually native CPU flow automatic variables, i.e. buffers local to the instructions for the platform being attacked. Here function, as shown in Figure1. By corrupting the the attacker is (ab)using the victim program’s buff- return address in the activation record, the attacker ers to store the attack code. Some nuances on this causes the program to jump to attack code when the method: victim function returns and dereferences the return address. This form of buffer overflow is called a • The attacker does not have to overflow any buff- “stack smashing attack” [14, 30, 28, 35] and consti- ers to do this; sufficient payload can be injected tute a majority of current buffer overflow attacks into perfectly reasonable buffers. Function Pointers: “void (* foo)()” declares • The buffer can be located anywhere: the variable foo which is of type “pointer to func- tion returning .” Function pointers can be allo- • on the stack (automatic variables) void cated anywhere (stack, heap, static data area) and so • on the heap (malloc’d variables) the attacker need only find an overflowable buffer • in the static data area (initialized or uninitial- adjacent to a function pointer in any of these areas ized) and overflow it to change the function pointer. Some time later, when the program makes a call It is already there: Often, the code to do what the through this function pointer, it will instead jump to attacker wants is already present in the program’s the attacker's desired location. An example of this address space. The attacker need only parameterize kind of attack appeared in an attack against the the code, and then cause the program to jump to it. superprobe program for Linux. For instance, if the attack code needs to execute “exec(“/bin/sh”)”, and there exists code in Longjmp buffers: C includes a simple checkpoint/roll- libc that executes “exec(arg)” where “arg” is a back system called setjmp/longjmp. The idiom is to string pointer argument, then the attacker need only say “setjmp(buffer)” to checkpoint, and say change a pointer to point to “/bin/sh” and jump “longjmp(buffer)” to go back to the check- to the appropriate instructions in the libc library point. However, if the attacker can corrupt the state [41]. of the buffer, then “longjmp(buffer)” will 2.2 Ways to Cause the Program to Jump to the 2.There are some bytes that are hard to inject, such as control Attacker's Code characters and null bytes that have special meaning to I/O All of these methods seek to alter the program’s libraries, and thus may be filtered before they reach the control flow so that the program will jump to the attack program’s memory. code. The basic method is to overflow a buffer that has 3.That this is possible is an indication of the weakness of C’s type system. — 2 — ize the code. For instance, there are code fragments in FFFF libc (linked to virtually every C program) that do Attack “exec(something)” where “something” is a parameter.
Load more

Recommended publications
  • Tesi Final Marco Oliverio.Pdf
    i Abstract Advancements in exploitation techniques call for the need of advanced defenses. Modern operating systems have to face new sophisticate attacks that do not rely on any programming mistake, rather they exploit leaking information from computational side effects (side-channel attacks) or hardware glitches (rowhammer attacks). Mitigating these new attacks poses new challanges and involves delicate trade-offs, balancing security on one side and performance, simplicity, and compatibility on the other. In this disseration we explore the attack surface exposed by page fusion, a memory saving optimization in modern operating systems and, after that, a secure page fusion implementation called VUsion is shown. We then propose a complete and compatible software solution to rowhammer attacks called ZebRAM. Lastly, we show OpenCAL, a free and general libray for the implementation of Cellular Automata, that can be used in several security scenarios. iii Acknowledgements I would like to thank my Supervisor prof. Andrea Pugliese for the encouragement and the extremely valuable advice that put me in a fruitful and exciting research direction. A hearty acknowledgment goes to Kaveh Razavi, Cristiano Giuffrida, Herbert Bos and all the VUSec group of the Vrije Universiteit of Amsterdam. I felt at home from day one and I found myself surrounded by brilliant researchers and good friends. v Contents Abstract i Acknowledgements iii Introduction1 1 VUsion3 1.1 Introduction...................................3 1.2 Page Fusion...................................5 1.2.1 Linux Kernel Same-page Merging...................5 1.2.2 Windows Page Fusion.........................7 1.3 Threat Model..................................8 1.4 Known Attack Vectors.............................8 1.4.1 Information Disclosure.........................8 1.4.2 Flip Feng Shui.............................9 1.5 New Attack Vectors..............................
    [Show full text]
  • An In-Depth Study with All Rust Cves
    Memory-Safety Challenge Considered Solved? An In-Depth Study with All Rust CVEs HUI XU, School of Computer Science, Fudan University ZHUANGBIN CHEN, Dept. of CSE, The Chinese University of Hong Kong MINGSHEN SUN, Baidu Security YANGFAN ZHOU, School of Computer Science, Fudan University MICHAEL R. LYU, Dept. of CSE, The Chinese University of Hong Kong Rust is an emerging programing language that aims at preventing memory-safety bugs without sacrificing much efficiency. The claimed property is very attractive to developers, and many projects start usingthe language. However, can Rust achieve the memory-safety promise? This paper studies the question by surveying 186 real-world bug reports collected from several origins which contain all existing Rust CVEs (common vulnerability and exposures) of memory-safety issues by 2020-12-31. We manually analyze each bug and extract their culprit patterns. Our analysis result shows that Rust can keep its promise that all memory-safety bugs require unsafe code, and many memory-safety bugs in our dataset are mild soundness issues that only leave a possibility to write memory-safety bugs without unsafe code. Furthermore, we summarize three typical categories of memory-safety bugs, including automatic memory reclaim, unsound function, and unsound generic or trait. While automatic memory claim bugs are related to the side effect of Rust newly-adopted ownership-based resource management scheme, unsound function reveals the essential challenge of Rust development for avoiding unsound code, and unsound generic or trait intensifies the risk of introducing unsoundness. Based on these findings, we propose two promising directions towards improving the security of Rust development, including several best practices of using specific APIs and methods to detect particular bugs involving unsafe code.
    [Show full text]
  • Ensuring the Spatial and Temporal Memory Safety of C at Runtime
    MemSafe: Ensuring the Spatial and Temporal Memory Safety of C at Runtime Matthew S. Simpson, Rajeev K. Barua Department of Electrical & Computer Engineering University of Maryland, College Park College Park, MD 20742-3256, USA fsimpsom, [email protected] Abstract—Memory access violations are a leading source of dereferencing pointers obtained from invalid pointer arith- unreliability in C programs. As evidence of this problem, a vari- metic; and dereferencing uninitialized, NULL or “manufac- ety of methods exist that retrofit C with software checks to detect tured” pointers.1 A temporal error is a violation caused by memory errors at runtime. However, these methods generally suffer from one or more drawbacks including the inability to using a pointer whose referent has been deallocated (e.g. with detect all errors, the use of incompatible metadata, the need for free) and is no longer a valid object. The most well-known manual code modifications, and high runtime overheads. temporal violations include dereferencing “dangling” point- In this paper, we present a compiler analysis and transforma- ers to dynamically allocated memory and freeing a pointer tion for ensuring the memory safety of C called MemSafe. Mem- more than once. Dereferencing pointers to automatically allo- Safe makes several novel contributions that improve upon previ- ous work and lower the cost of safety. These include (1) a method cated memory (stack variables) is also a concern if the address for modeling temporal errors as spatial errors, (2) a compati- of the referent “escapes” and is made available outside the ble metadata representation combining features of object- and function in which it was defined.
    [Show full text]
  • Improving Memory Management Security for C and C++
    Improving memory management security for C and C++ Yves Younan, Wouter Joosen, Frank Piessens, Hans Van den Eynden DistriNet, Katholieke Universiteit Leuven, Belgium Abstract Memory managers are an important part of any modern language: they are used to dynamically allocate memory for use in the program. Many managers exist and depending on the operating system and language. However, two major types of managers can be identified: manual memory allocators and garbage collectors. In the case of manual memory allocators, the programmer must manually release memory back to the system when it is no longer needed. Problems can occur when a programmer forgets to release it (memory leaks), releases it twice or keeps using freed memory. These problems are solved in garbage collectors. However, both manual memory allocators and garbage collectors store management information for the memory they manage. Often, this management information is stored where a buffer overflow could allow an attacker to overwrite this information, providing a reliable way to achieve code execution when exploiting these vulnerabilities. In this paper we describe several vulnerabilities for C and C++ and how these could be exploited by modifying the management information of a representative manual memory allocator and a garbage collector. Afterwards, we present an approach that, when applied to memory managers, will protect against these attack vectors. We implemented our approach by modifying an existing widely used memory allocator. Benchmarks show that this implementation has a negligible, sometimes even beneficial, impact on performance. 1 Introduction Security has become an important concern for all computer users. Worms and hackers are a part of every day internet life.
    [Show full text]
  • Buffer Overflows Buffer Overflows
    L15: Buffer Overflow CSE351, Spring 2017 Buffer Overflows CSE 351 Spring 2017 Instructor: Ruth Anderson Teaching Assistants: Dylan Johnson Kevin Bi Linxing Preston Jiang Cody Ohlsen Yufang Sun Joshua Curtis L15: Buffer Overflow CSE351, Spring 2017 Administrivia Homework 3, due next Friday May 5 Lab 3 coming soon 2 L15: Buffer Overflow CSE351, Spring 2017 Buffer overflows Address space layout (more details!) Input buffers on the stack Overflowing buffers and injecting code Defenses against buffer overflows 3 L15: Buffer Overflow CSE351, Spring 2017 not drawn to scale Review: General Memory Layout 2N‐1 Stack Stack . Local variables (procedure context) Heap . Dynamically allocated as needed . malloc(), calloc(), new, … Heap Statically allocated Data . Read/write: global variables (Static Data) Static Data . Read‐only: string literals (Literals) Code/Instructions Literals . Executable machine instructions Instructions . Read‐only 0 4 L15: Buffer Overflow CSE351, Spring 2017 not drawn to scale x86‐64 Linux Memory Layout 0x00007FFFFFFFFFFF Stack Stack . Runtime stack has 8 MiB limit Heap Heap . Dynamically allocated as needed . malloc(), calloc(), new, … Statically allocated data (Data) Shared Libraries . Read‐only: string literals . Read/write: global arrays and variables Code / Shared Libraries Heap . Executable machine instructions Data . Read‐only Instructions Hex Address 0x400000 0x000000 5 L15: Buffer Overflow CSE351, Spring 2017 not drawn to scale Memory Allocation Example Stack char big_array[1L<<24]; /* 16 MB */ char huge_array[1L<<31]; /* 2 GB */ int global = 0; Heap int useless() { return 0; } int main() { void *p1, *p2, *p3, *p4; Shared int local = 0; Libraries p1 = malloc(1L << 28); /* 256 MB */ p2 = malloc(1L << 8); /* 256 B */ p3 = malloc(1L << 32); /* 4 GB */ p4 = malloc(1L << 8); /* 256 B */ Heap /* Some print statements ..
    [Show full text]
  • Memory Vulnerability Diagnosis for Binary Program
    ITM Web of Conferences 7 03004 , (2016) DOI: 10.1051/itmconf/20160703004 ITA 2016 Memory Vulnerability Diagnosis for Binary Program Feng-Yi TANG, Chao FENG and Chao-Jing TANG College of Electronic Science and Engineering National University of Defense Technology Changsha, China Abstract. Vulnerability diagnosis is important for program security analysis. It is a further step to understand the vulnerability after it is detected, as well as a preparatory step for vulnerability repair or exploitation. This paper mainly analyses the inner theories of major memory vulnerabilities and the threats of them. And then suggests some methods to diagnose several types of memory vulnerabilities for the binary programs, which is a difficult task due to the lack of source code. The diagnosis methods target at buffer overflow, use after free (UAF) and format string vulnerabilities. We carried out some tests on the Linux platform to validate the effectiveness of the diagnosis methods. It is proved that the methods can judge the type of the vulnerability given a binary program. 1 Introduction (or both) the memory area. These headers can contain some information like size, used or not, and etc. Memory vulnerabilities are difficult to detect and diagnose Therefore, we can monitor the allocator so as to especially for those do not crash the program. Due to its determine the base address and the size of the allocation importance, vulnerability diagnosis problem has been areas. Then, check all STORE and LOAD accesses in intensively studied. Researchers have proposed different memory to see which one is outside the allocated area. techniques to diagnose memory vulnerabilities.
    [Show full text]
  • A Buffer Overflow Study
    A Bu®er Overflow Study Attacks & Defenses Pierre-Alain FAYOLLE, Vincent GLAUME ENSEIRB Networks and Distributed Systems 2002 Contents I Introduction to Bu®er Overflows 5 1 Generalities 6 1.1 Process memory . 6 1.1.1 Global organization . 6 1.1.2 Function calls . 8 1.2 Bu®ers, and how vulnerable they may be . 10 2 Stack overflows 12 2.1 Principle . 12 2.2 Illustration . 12 2.2.1 Basic example . 13 2.2.2 Attack via environment variables . 14 2.2.3 Attack using gets . 16 3 Heap overflows 18 3.1 Terminology . 18 3.1.1 Unix . 18 3.1.2 Windows . 18 3.2 Motivations and Overview . 18 3.3 Overwriting pointers . 19 3.3.1 Di±culties . 20 3.3.2 Interest of the attack . 20 3.3.3 Practical study . 20 3.4 Overwriting function pointers . 24 3.4.1 Pointer to function: short reminder . 24 3.4.2 Principle . 24 3.4.3 Example . 25 3.5 Trespassing the heap with C + + . 28 3.5.1 C++ Background . 28 3.5.2 Overwriting the VPTR . 31 3.5.3 Conclusions . 32 3.6 Exploiting the malloc library . 33 3.6.1 DLMALLOC: structure . 33 3.6.2 Corruption of DLMALLOC: principle . 34 II Protection solutions 37 4 Introduction 38 1 5 How does Libsafe work? 39 5.1 Presentation . 39 5.2 Why are the functions of the libC unsafe ? . 39 5.3 What does libsafe provide ? . 40 6 The Grsecurity Kernel patch 41 6.1 Open Wall: non-executable stack .
    [Show full text]
  • Buffer Overflow and Format String Overflow Vulnerabilities 3
    Syracuse University SURFACE Electrical Engineering and Computer Science College of Engineering and Computer Science 2002 Buffer Overflow and ormatF String Overflow ulnerV abilities Kyung-suk Lhee Syracuse University Steve J. Chapin Syracuse University Follow this and additional works at: https://surface.syr.edu/eecs Part of the Computer Sciences Commons Recommended Citation Lhee, Kyung-suk and Chapin, Steve J., "Buffer Overflow and ormatF String Overflow ulnerV abilities" (2002). Electrical Engineering and Computer Science. 96. https://surface.syr.edu/eecs/96 This Article is brought to you for free and open access by the College of Engineering and Computer Science at SURFACE. It has been accepted for inclusion in Electrical Engineering and Computer Science by an authorized administrator of SURFACE. For more information, please contact [email protected]. SOFTWARE|PRACTICE AND EXPERIENCE Softw. Pract. Exper. 2002; 00:1{7 Bu®er Overflow and Format String Overflow Vulnerabilities Kyung-Suk Lhee and Steve J. Chapin¤,y Center for Systems Assurance, Syracuse University, Syracuse, NY 13210 SUMMARY Bu®er overflow vulnerabilities are among the most widespread of security problems. Numerous incidents of bu®er overflow attacks have been reported and many solutions have been proposed, but a solution that is both complete and highly practical is yet to be found. Another kind of vulnerability called format string overflow has recently been found, and though not as popular as bu®er overflow, format string overflow attacks are no less dangerous. This article surveys representative techniques of exploiting bu®er overflow and format string overflow vulnerabilities and their currently available defensive measures. We also describe our bu®er overflow detection technique that range checks the referenced bu®ers at run time.
    [Show full text]
  • Chapter 10 Buffer Overflow Buffer Overflow
    Chapter 10 Buffer Overflow Buffer Overflow ● Common attack mechanism ○ first wide use by the Morris Worm in 1988 ● Prevention techniques known ○ NX bit, stack canaries, ASLR ● Still of major concern ○ Recent examples: Shellshock, Hearthbleed Buffer Overflow/Buffer Overrun Definition: A condition at an interface under which more input can be placed into a buffer or data holding area than the capacity allocated, overwriting other information. Attackers exploit such a condition to crash a system or to insert specially crafted code that allows them to gain control of the system. Buffer Overflow Basics ● Programming error when a process attempts to store data beyond the limits of a fixed-sized buffer ● Overwrites adjacent memory locations ○ locations may hold other program variables, parameters, or program control flow data ○ buffer could be located on the stack, in the heap, or in the data section of the process ● Consequences: ○ corruption of program data ○ unexpected transfer of control ○ memory access violations Basic Buffer Overflow Example Basic Buffer Overflow Stack Values Buffer Overflow Attacks Attacker needs: ● To identify a buffer overflow vulnerability in some program that can be triggered using externally sourced data under the attacker’s control ● To understand how that buffer is stored in memory and determine potential for corruption Identifying vulnerable programs can be done by: ● inspection of program source ● tracing the execution of programs as they process oversized input ● using tools such as fuzzing to automatically identify
    [Show full text]
  • Memory Management
    Memory Management Advanced Operating System Lecture 5 Colin Perkins | https://csperkins.org/ | Copyright © 2017 | This work is licensed under the Creative Commons Attribution-NoDerivatives 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nd/4.0/ or send a letter to Creative Commons, PO Box 1866, Mountain View, CA 94042, USA. Lecture Outline • Virtual memory • Layout of a processes address space • Stack • Heap • Program text, shared libraries, etc. • Memory management Colin Perkins | https://csperkins.org/ | Copyright © 2017 2 Virtual Memory (1) • Processes see virtual addresses – each process believes it has access to the entire address space • Kernel programs the MMU (“memory management unit”) to translate these into physical addresses, representing real memory – mapping changed each context switch to another process Main memory! CPU chip! 0:! Virtual! Address! Physical! 1:! address! translation! address! 2:! (VA)! (PA)! 3:! CPU! MMU! 4:! 4100 4 5:! 6:! 7:! ... ! Source: Bryant & O’Hallaron, “Computer Systems: A Programmer’s Perspective”, 3rd Edition, Pearson, 2016. Fig. 9.2. http://csapp.cs.cmu.edu/ M-1:! 3e/figures.html (website grants permission for lecture use with attribution) Data word! Colin Perkins | https://csperkins.org/ | Copyright © 2017 3 Virtual Memory (2) Virtual address spaces! Physical memory! • Virtual-to-physical memory mapping 0! 0! Address translation! can be unique or shared VP 1! Process i:! VP 2! • Unique mappings typical – physical memory N-1! owned by a single process Shared page! • Shared mappings allow one read-only copy 0! Process j:! VP 1! of a shared library to be accessed by many VP 2! processes N-1! M-1! Source: Bryant & O’Hallaron, “Computer Systems: A Programmer’s Perspective”, • Memory protection done at page level – each 3rd Edition, Pearson, 2016.
    [Show full text]
  • Table of Contents
    Table of Contents Cybersecurity and Cyber Systems........................................................................1 Cybersecurity and Cyber Systems The Master of Science degree in Cybersecurity and Cyber Systems is an interdisciplinary program offered through the School of Computing and the School of Electrical, Computer, and Biomedical Engineering. Master of Science (M.S.) in Cybersecurity and Cyber Systems Admission Applicants with a bachelors degree in Computer Science, Engineering, Physics, Mathematics, Information Systems or equivalent degrees will be admitted directly as long as their GPA satisfies Graduate School requirements. The M.S. in Cybersecurity and Cyber Systems requires 30 credit hours. Students can select an area of study in cybersecurity or in cyber systems. For applicants lacking the required specific background, we offer conditional admission status until completing prerequisite courses. Admission to the M.S. in Cybersecurity and Cyber Systems program is based on the following factors: grade point average of 2.75 or higher on a scale of 4.0 on approximately the last 60 credit hours of undergraduate coursework, class ranking, and faculty recommendation letters. Although GRE scores are not required for admission, they are important to qualify for the High Achievers Tuition Rate. See also tuition.siuc.edu/highachievers2.html. The minimum TOEFL score requirement for international applicants is 550 (paper-based) or 80 (computer-based). The program requires a nonrefundable $65 application fee that must be submitted with the application for admissions to the M.S. program in Cybersecurity and Cyber Systems. Students must apply online and pay this fee by credit card. Please address any correspondence to “Master of Science Program in Cybersecurity and Cyber Systems,” 1230 Lincoln Drive, Southern Illinois University Carbondale, Carbondale, Illinois 62901, Mailcode 6603 or Mailcode 4511.
    [Show full text]
  • Diehard: Probabilistic Memory Safety for Unsafe Languages
    DieHard: Probabilistic Memory Safety for Unsafe Languages Emery D. Berger Benjamin G. Zorn Dept. of Computer Science Microsoft Research University of Massachusetts Amherst One Microsoft Way Amherst, MA 01003 Redmond, WA 98052 [email protected] [email protected] Abstract Invalid frees: Passing illegal addresses to free can corrupt the Applications written in unsafe languages like C and C++ are vul- heap or lead to undefined behavior. nerable to memory errors such as buffer overflows, dangling point- Double frees: Repeated calls to free of objects that have already ers, and reads of uninitialized data. Such errors can lead to program been freed undermine the integrity of freelist-based allocators. crashes, security vulnerabilities, and unpredictable behavior. We present DieHard, a runtime system that tolerates these errors while Tools like Purify [17] and Valgrind [28, 34] allow programmers to probabilistically maintaining soundness. DieHard uses randomiza- pinpoint the exact location of these memory errors (at the cost of a tion and replication to achieve probabilistic memory safety through 2-25X performance penalty), but only reveal those bugs found dur- the illusion of an infinite-sized heap. DieHard’s memory manager ing testing. Deployed programs thus remain vulnerable to crashes randomizes the location of objects in a heap that is at least twice or attack. Conservative garbage collectors can, at the cost of in- as large as required. This algorithm not only prevents heap corrup- creased runtime and additional memory [10, 20], disable calls to tion but also provides a probabilistic guarantee of avoiding memory free and so eliminate three of the above errors (invalid frees, dou- errors.
    [Show full text]