Intra stack frame randomization for protecting applications against code injection attack
View Patent ↗A method of randomizing locations of variables in a stack includes: identifying a plurality of stack locations corresponding to a plurality of variables; shuffling the stack locations of the variables to produce shuffled stack locations; and updating the stack locations of the variables with the shuffled stack locations.
1. A computer implemented method of randomizing locations of variables in a stack associated with a software application, prior to said randomizing locations, the stack including, in order from a bottom of the stack to a top of the stack, a return address for a function call, a local variable and an attackable buffer, the method comprising:
identifying, by one or more processors, a local function in the software application;
identifying, by the one or more processors, a plurality of stack locations of a plurality of variables in the identified local function;
identifying, by the one or more processors, references to each of the plurality of variables in the identified local function;
shuffling, by an executable loader that loads the software application, the stack locations of the variables to produce shuffled stack locations of the variables, each time that the software application is loaded into a memory, wherein each execution of the software program results in a different shuffling, wherein said shuffled stack locations of the variables changes a critical stack distance between the return address for the local function and the attackable buffer, and wherein the critical stack distance is a sum of a size of the local variable and a size of the attackable buffer; and
updating the stack locations of the variables with the shuffled stack locations.
2. The method of claim 1 , wherein the identifying the stack locations comprises identifying variables in object code, and
wherein the updating the stack locations of the variables comprises updating the object code with the shuffled stack locations.
3. The method of claim 1 , wherein the identifying the stack locations comprises identifying variables in binary code, and
wherein the updating the stack locations of the variables comprises updating the binary code with the shuffled stack locations.
4. The method of claim 1 , wherein the identifying the stack locations comprises identifying variables in executable code loaded into memory, and
wherein the updating the stack locations of the variables comprises updating the executable code loaded into memory with the shuffled stack locations.
5. The method of claim 4 , wherein the shuffling the stack locations of the variables to produce shuffled stack locations and the updating the stack locations of the variables with the shuffled stack locations occur prior to execution of the executable code.
6. The method of claim 4 , wherein the shuffling the stack locations of the variables to produce shuffled stack locations and the updating the stack locations of the variables with the shuffled stack locations occur during execution of the executable code.
7. A non-transitory computer readable medium embodying program instructions for execution by a data processing apparatus for randomizing locations of variables in a stack associated with a software application, prior to said randomizing locations, the stack including, in order from a bottom of the stack to a top of the stack, a return address for a function call, a local variable and an attackable buffer, the program instructions adapting the data processing apparatus for:
identifying, by one or more processors, a local function in the software application;
identifying, by the one or more processors, a plurality of stack locations of a plurality of variables in the identified local function;
identifying, by the one or more processors, references to each of the plurality of variables in the identified local function;
shuffling, by an executable loader that loads the software application, the stack locations of the variables to produce shuffled stack locations of the variables, each time that the software application is loaded into a memory, wherein each execution of the software program results in a different shuffling, aid wherein said shuffled stack locations of the variables changes a critical stack distance between the return address for the local function and the attackable buffer, and wherein the critical stack distance is a sum of a size of the local variable and a size of the attackable buffer; and
updating the stack locations of the variables with the shuffled stack locations.
8. The non-transitory computer readable medium of claim 7 , wherein the identifying the stack locations comprises identifying variables in object code, and
wherein the updating the stack locations of the variables comprises updating the object code with the shuffled stack locations.
9. The non-transitory computer readable medium of claim 7 , wherein the identifying the stack locations comprises identifying variables in binary code, and
wherein the updating the stack locations of the variables comprises updating the binary code with the shuffled stack locations.
10. The non-transitory computer readable medium of claim 7 , wherein the identifying the stack locations comprises identifying variables in executable code loaded into memory, and
wherein the updating the stack locations of the variables comprises updating the executable code loaded into memory with the shuffled stack locations.
11. The non-transitory computer readable medium of claim 10 , wherein the shuffling the stack locations of the variables to produce shuffled stack locations and the updating the stack locations of the variables with the shuffled stack locations occur prior to execution of the executable code.
12. The non-transitory computer readable medium of claim 10 , wherein the shuffling the stack locations of the variables to produce shuffled stack locations and the updating the stack locations of the variables with the shuffled stack locations occur during execution of the executable code.
13. A computer system for randomizing locations of variables in a stack associated with a software application, prior to said randomizing locations, the stack including, in order from a bottom of the stack to a top of the stack, a return address for a function call, a local variable and an attackable buffer, comprising:
a processor; and
memory storing program instructions, the program instructions being configured to control the computer system to:
identify, by the processor, a local function in the software application;
identify, by the processor, a plurality of stack locations of a plurality of variables in the identified local function;
identify, by the processor, references to each of the plurality of variables in the identified local function;
shuffle, by an executable loader that loads the software application, the stack locations of the variables to produce shuffled stack locations of the variables, each time that the software application is loaded into the memory, wherein each execution of the software program results in a different shuffling, wherein said shuffled stack locations of the variables changes a critical stack distance between the return address for the local function and the attackable buffer, and wherein the critical stack distance is a sum of a size of the local variable and a size of the attackable buffer; and
update the stack locations of the variables with the shuffled stack locations.
14. The computer system of claim 13 , wherein the identifying the stack locations comprises identifying variables in object code, and
wherein the updating the stack locations of the variables comprises updating the object code with the shuffled stack locations.
15. The computer system of claim 13 , wherein the identifying the stack locations comprises identifying variables in binary code, and
wherein the updating the stack locations of the variables comprises updating the binary code with the shuffled stack locations.
16. The computer system of claim 13 , wherein the identifying the stack locations comprises identifying variables in executable code loaded into memory, and
wherein the updating the stack locations of the variables comprises updating the executable code loaded into memory with the shuffled stack locations.
17. The computer system of claim 16 , wherein the shuffling the stack locations of the variables to produce shuffled stack locations and the updating the stack locations of the variables with the shuffled stack locations occur prior to execution of the executable code.
18. The computer system of claim 16 , wherein the shuffling the stack locations of the variables to produce shuffled stack locations and the updating the stack locations of the variables with the shuffled stack locations occur during execution of the executable code.