The Reduced Address Space (RAS) for Application Memory Authentication

  • Authors:

  • David Champagne;Reouven Elbaz;Ruby B. Lee

  • Affiliations:

  • Department of Electrical Engineering, Princeton University, Princeton, USA NJ 08544;Department of Electrical Engineering, Princeton University, Princeton, USA NJ 08544;Department of Electrical Engineering, Princeton University, Princeton, USA NJ 08544

  • Venue:
  • ISC '08 Proceedings of the 11th international conference on Information Security
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Memory authentication is the ability to detect unauthorized modification of memory. Existing solutions for memory authentication are based on tree structures computed over either the Physical Address Space (PAS tree) or the Virtual Address Space (VAS tree). We show that the PAS tree is vulnerable to branch splicingattacks when providing memory authentication to an application running on a potentially compromised operating system. We also explain why the VAS tree generates initialization and memory overheads so large as to make it impractical, especially on 64-bit address spaces. To enable secure and efficient application memory authentication, we present a novel Reduced Address Space(RAS) containing only those pages that are useful to a protected application at any point in time. We introduce the Tree Management Unit(TMU) to manage the RAS tree, a dynamically expanding memory integrity tree computed over the RAS. The TMU is scalable, enabling tree schemes to scale up to cover 64-bit address spaces. It dramatically reduces the overheads of application memory authentication without weakening the security properties or degrading runtime performance. For SPEC 2000 benchmarks, the TMU speeds up tree initialization and reduces memory overheads by three orders of magnitude on average.