Title :
Implicit Buffer Overflow Protection Using Memory Segregation
Author :
Roth, Brent G. ; Spafford, Eugene H.
Author_Institution :
Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
Abstract :
Computing systems continue to be plagued by malicious corruption of instructions and data. Buffer overflows, in particular, are often employed to disrupt the control flow of vulnerable processes. Existing methods of protection against these attacks operate by detecting corruption after it has taken place or by ensuring that if corruption has taken place, it cannot be used to hijack a process´ control flow. These methods thus still allow the corruption of control data to occur but, rather than being subverted, the process may terminate or take some other defined error. Few methods have attempted to prevent the corruption of control data, and those that have only focused on preventing the corruption of the return address. We propose the use of multiple memory segments to support multiple stacks, heaps, bss, and data sections per process with the goal of segregating control and non-control data. By segregating these different forms of data, we can prevent the corruption of control data by overflow and address manipulation of memory allocated for non-control data. We show that the creation of these additional data segments per process can be implemented through modifications to the compiler.
Keywords :
program compilers; security of data; storage management; address manipulation; compiler; control data corruption; data segmentation; implicit buffer overflow protection; memory segregation; overflow manipulation; Computer crime; Libraries; Memory management; Process control; Program processors; Registers; Resource management; buffer overflow; memory protection; memory segmentation; memory segregation; multiple heaps; multiple stacks;
Conference_Titel :
Availability, Reliability and Security (ARES), 2011 Sixth International Conference on
Conference_Location :
Vienna
Print_ISBN :
978-1-4577-0979-1
Electronic_ISBN :
978-0-7695-4485-4
DOI :
10.1109/ARES.2011.32