Where's the FEEB? the effectiveness of instruction set randomization

  • Authors:
  • Ana Nora Sovarel;David Evans;Nathanael Paul

  • Affiliations:
  • University of Virginia, Department of Computer Science;University of Virginia, Department of Computer Science;University of Virginia, Department of Computer Science

  • Venue:
  • SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Instruction Set Randomization (ISR) has been proposed as a promising defense against code injection attacks. It defuses all standard code injection attacks since the attacker does not know the instruction set of the target machine. A motivated attacker, however, may be able to circumvent ISR by determining the randomization key. In this paper, we investigate the possibility of a remote attacker successfully ascertaining an ISR key using an incremental attack. We introduce a strategy for attacking ISR-protected servers, develop and analyze two attack variations, and present a technique for packaging a worm with a miniature virtual machine that reduces the number of key bytes an attacker must acquire to 100. Our attacks can break enough key bytes to infect an ISR-protected server in about six minutes. Our results provide insights into properties necessary for ISR implementations to be secure.