A Write-Friendly and Fast-Recovery Scheme for Security Metadata in NVM
Jianming Huang, Yu Hua

TL;DR
This paper introduces STAR, a novel scheme that significantly reduces write overhead and recovery time for security metadata in NVMs, enhancing crash recovery efficiency and security integrity.
Contribution
STAR provides a cost-efficient, configurable recovery scheme for security metadata in NVMs, reducing write overhead by up to 87% and enabling faster crash recovery.
Findings
STAR reduces memory writes by up to 87% compared to Anubis.
STAR achieves faster recovery times, e.g., 0.004s for a 4MB cache.
STAR maintains security integrity with low overhead.
Abstract
Non-Volatile Memories (NVMs) have attracted the attentions of academia and industry, which is expected to become the next-generation memory. However, due to the nonvolatile property, NVMs become vulnerable to attacks and require security mechanisms, e.g., counter mode encryption and integrity tree, which introduce the security metadata. NVMs promise to recover these security metadata after a system crash, including the counter and integrity tree. However, unlike merkle tree reconstructed from user data, recovering SGX integrity tree (SIT) has to address the challenges from unique top-down hierarchical dependency. Moreover, writing overhead and recovery time are important metrics for evaluating persistent memory system due to the high costs of NVM writes and IT downtime. How to recover the security metadata, i.e., counter blocks and integrity tree nodes, with low write overhead and short…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Memory and Neural Computing · Advanced Data Storage Technologies · Parallel Computing and Optimization Techniques
