A Write-Friendly and Fast-Recovery Scheme for Security Metadata in Non-Volatile Memories
Jianming Huang, Yu Hua
Abstract
Non-Volatile Memories (NVMs) require security mechanisms, e.g., counter mode encryption and integrity tree verification, which are important to protect systems in terms of encryption and data integrity. These security mechanisms heavily rely on extra security metadata that need to be efficiently and accurately recovered after system crashes or power off. Established SGX integrity tree (SIT) becomes efficient to protect system integrity and however fails to be restored from leaves, since the computations of SIT nodes need their parent nodes as inputs. To recover the security metadata with low write overhead and short recovery time, we propose an efficient and instantaneous persistence scheme, called STAR, which instantly persists the modifications of security metadata without extra memory writes. STAR is motivated by our observation that the parent nodes in cache are modified due to persisting their child nodes. STAR stores the modifications of parent nodes in their child nodes and persists them just using one atomic memory write. To eliminate the overhead of persisting the modifications, STAR coalesces the modifications and MACs in the evicted metadata. For fast recovery and verification of the metadata, STAR uses bitmap lines in asynchronous DRAM refresh (ADR) to indicate the locations of stale metadata, and constructs a cached merkle tree to verify the correctness of the recovery process. Our evaluation results show that compared with state-of-the-art work, our proposed STAR delivers high performance, low write traffic, low energy consumption and short recovery time.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b18bcd37-3fa8-4072-bab0-ce82e90ff040Cited by top-tier papers3
- Root Crash Consistency of SGX-style Integrity Trees in Secure Non-Volatile Memory SystemsJianming Huang, Yu HuaHPCA 2023 · 6 citations
- Counter-light Memory EncryptionXin Wang, Jagadish Kotra, Alex Jones, Wenjie Xiong et al.ISCA 2024 · 5 citations
- Scalable crash consistency for secure persistent memoryMing Zhang, Yu Hua, Xuan Li, Hao XuDAC 2022 · 2 citations
Related papers
- Crystalor: Recoverable Memory Encryption Mechanism with Optimized Metadata StructureRei Ueno, Hiromichi Haneda, Naofumi Homma, Akiko Inoue et al.CCS 2024
- A Midsummer Night's Tree: Efficient and High Performance Secure SCMSamuel Thomas, Kidus Workneh, Jac McCarty, Joseph Izraelevitz et al.ASPLOS 2024 · 5 citations
- Persist Level Parallelism: Streamlining Integrity Tree Updates for Secure Persistent MemoryAlexander Freij, Shougang Yuan, Huiyang Zhou, Yan SolihinMICRO 2020 · 31 citations
- Bonsai Merkle Forests: Efficiently Achieving Crash Consistency in Secure Persistent MemoryAlexander Freij, Huiyang Zhou, Yan SolihinMICRO 2021 · 32 citations
- Compact Leakage-Free Support for Integrity and ReliabilityMeysam Taassori, Rajeev Balasubramonian, Siddhartha Chhabra, Alaa R. Alameldeen et al.ISCA 2020 · 22 citations
