This Article 
 Bibliographic References 
 Add to: 
22nd International Symposium on Reliable Distributed Systems (SRDS'03)
Transparent Runtime Randomization for Security
Florence, Italy
October 06-October 08
ISBN: 0-7695-1955-5
Jun Xu, University of Illinois at Urbana-Champaign
Zbigniew Kalbarczyk, University of Illinois at Urbana-Champaign
Ravishankar K. Iyer, University of Illinois at Urbana-Champaign
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a generalized approach for protecting against a wide range of security attacks. TRR dynamically and randomly relocates a program?s stack, heap, shared libraries, and parts of its runtime control data structures inside the application memory address space. Making a program?s memory layout different each time it runs foils the attacker?s assumptions about the memory layout of the vulnerable program and makes the determination of critical address values difficult if not impossible. TRR is implemented by changing the Linux dynamic program loader, hence it is transparent to applications. We demonstrate that TRR is effective in defeating real security attacks, including malloc-based heap overflow, integer overflow, and double-free attacks, for which effective prevention mechanisms are yet to emerge. Furthermore, TRR incurs less than 9% program startup overhead and no runtime overhead.
Jun Xu, Zbigniew Kalbarczyk, Ravishankar K. Iyer, "Transparent Runtime Randomization for Security," srds, pp.260, 22nd International Symposium on Reliable Distributed Systems (SRDS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.