Caches and Hash Trees for Efficient Memory Integrity Verification

@inproceedings{Gassend2003CachesAH,
  title={Caches and Hash Trees for Efficient Memory Integrity Verification},
  author={Blaise Gassend and G. Edward Suh and Dwaine E. Clarke and Marten van Dijk and Srinivas Devadas},
  booktitle={HPCA},
  year={2003}
}
We study the hardware cost of 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 of our methods, the performance overhead is less than 25%, a significant decrease from the 10× overhead of a naive… CONTINUE READING
Highly Influential
This paper has highly influenced 24 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 225 citations. REVIEW CITATIONS

9 Figures & Tables

Topics

Statistics

0102030'04'06'08'10'12'14'16'18
Citations per Year

226 Citations

Semantic Scholar estimates that this publication has 226 citations based on the available data.

See our FAQ for additional information.