Local Memory via Layout Randomization

—Randomization is used in computer security as a tool to introduce unpredictability into the software infrastructure. In this paper, we study the use of randomization to achieve the secrecy and integrity guarantees for local memory. We follow the approach set out by Abadi and Plotkin (2010). We consider the execution of an idealized language in two environments. In the strict environment, opponents cannot access local variables of the user program. In the lax environment, opponents may attempt to guess allocated memory locations and thus, with small probability, gain access the local memory of the user program. We model these environments using two novel calculi: λµhashref and λµproberef. Our contribution to the Abadi-Plotkin program is to enrich the programming language with dynamic memory allocation, first class and higher order references and call/cc-style control. On the one hand, these enhancements allow us to directly model a larger class of system hardening principles. On...

• Type: Journal
• Year: 2011
• Where: CSFW
• Authors: Radha Jagadeesan, Corin Pitcher, Julian Rathke, James Riely
• Keywords: CSFW 2011, Dynamic Memory Allocation, Integrity Guarantees, Programming Language Features, Security Privacy