Research in Attacks, Intrusions, and Defenses

Volume 8145 of the series Lecture Notes in Computer Science pp 82-102

Systematic Analysis of Defenses against Return-Oriented Programming

  • Richard SkowyraAffiliated withBoston University
  • , Kelly CasteelAffiliated withMIT Lincoln Laboratory
  • , Hamed OkhraviAffiliated withMIT Lincoln Laboratory
  • , Nickolai ZeldovichAffiliated withMIT CSAIL
  • , William StreileinAffiliated withMIT Lincoln Laboratory

* Final gross prices may vary according to local VAT.

Get Access


Since the introduction of return-oriented programming, increasingly complex defenses and subtle attacks that bypass them have been proposed. Unfortunately the lack of a unifying threat model among code reuse security papers makes it difficult to evaluate the effectiveness of defenses, and answer critical questions about the interoperability, composability, and efficacy of existing defensive techniques. For example, what combination of defenses protect against every known avenue of code reuse? What is the smallest set of such defenses? In this work, we study the space of code reuse attacks by building a formal model of attacks and their requirements, and defenses and their assumptions. We use a SAT solver to perform scenario analysis on our model in two ways. First, we analyze the defense configurations of a real-world system. Second, we reason about hypothetical defense bypasses. We prove by construction that attack extensions implementing the hypothesized functionality are possible even if a ‘perfect’ version of the defense is implemented. Our approach can be used to formalize the process of threat model definition, analyze defense configurations, reason about composability and efficacy, and hypothesize about new attacks and defenses.