Binary shuffling : defeating memory disclosure attacks through re-randomization

This work strengthens code randomization against memory disclosure attacks, in order to make it a viable defense in the face of Return-Oriented Programming, and proposes a technique called binary shuffling, which dynamically re-randomizes the position of code blocks at runtime.