Baobab Merkle Tree for Efficient Secure Memory
- 31 January 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (1) , 33-36
Abstract
Secure memory is a natural solution to hardware vulnerabilities in memory, but it faces fundamental challenges of performance and memory overheads. While significant work has gone into optimizing the protocol for performance, far less work has gone into optimizing its memory overhead. In this work, we propose the Baobab Merkle Tree, in which counters are memoized in an on-chip table. The Baobab Merkle Tree reduces spatial overhead of a Bonsai Merkle Tree by 2-4X without incurring performance overhead.Keywords
This publication has 15 references indexed in Scilit:
- Self-Reinforcing Memoization for Cryptography Calculations in Secure Memory Systems2022
- Morphable Counters: Enabling Compact Integrity Trees For Low-Overhead Secure Memories2018
- SYNERGY: Rethinking Secure-Memory Design for Error-Correcting Memories2018
- PoisonIvy: Safe speculation for secure memory2016
- Taking off the gloves with reference counting ImmixACM SIGPLAN Notices, 2013
- i-NVMM2011
- Efficient Encryption-Authentication of Shared Bus-Memory in SMP System2010
- The Benchmark Suite2008
- Using Address Independent Seed Encryption and Bonsai Merkle Trees to Make Secure Processors OS- and Performance-Friendly2007
- Improving Cost, Performance, and Security of Memory Encryption and AuthenticationACM SIGARCH Computer Architecture News, 2006