Caches and Hash Trees for Efficient Memory Integrity Verification

  • Authors:
  • Blaise Gassend;G. Edward Suh;Dwaine Clarke;Marten van Dijk;Srinivas Devadas

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the hardware cost f implementing hash-tree based verification of untrusted external memory by a high performance processor.This verification could enable applications such as certified program execution.A number of schemes are presented with different levels of integration between the on-processor L2 cache and the hash-tree machinery. Simulations show that for the best ofour methods, the performance overhead is less than 25%, a significant decrease from the 10脳 overhead of a naive implementation.