DISSECT: Dynamic Skew-and-Split Tree for Memory Authentication
| Autor: | Rohan Juneja, Siew-Kei Lam, Saru Vig |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
010302 applied physics
Dynamic random-access memory Authentication business.industry Computer science Hash function 02 engineering and technology Parallel computing Arity Encryption 01 natural sciences 020202 computer hardware & architecture law.invention Tree (data structure) Tree structure law 0103 physical sciences 0202 electrical engineering electronic engineering information engineering Overhead (computing) business |
| Zdroj: | DATE |
| DOI: | 10.23919/date48585.2020.9116548 |
| Popis: | Memory integrity trees are widely-used to protect external memories in embedded systems against replay, splicing and spoofing attacks. However, existing methods often result in high-performance overhead that is proportional to the height of the tree. Reducing the height of the integrity tree by increasing its arity, however, leads to frequent overflowing of the counters that are used for encryption in the tree. We will show that increasing the tree arity of a widely-use integrity tree from 2 to 8 can result in over 200% increase in memory authentication overhead for some benchmark applications, despite the reduction in tree height. In this paper, we propose DISSECT, a memory authentication framework which utilizes a dynamic memory integrity tree that can adapt to the memory access patterns of the application by progressively adjusting the tree height and arity in order to significantly reduce performance overhead. This is achieved by 1) initializing an integrity tree structure with the largest arity possible to meet the security requirements, 2) dynamically skewing the tree such that the more frequently accessed memory locations are positioned closer to the tree root (overcomes the tree height problem), and 3) dynamically splitting the tree at nodes with counters that are about to overflow (overcomes the counter overflow problem). Experimental results undertaken using Multi2Sim on benchmarks from SPEC-CPU2006, SPLASH-2, and PARSEC demonstrate the performance benefits of our proposed memory integrity tree. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|