An Efficiant Persistency and Recovery Mechanism for SGX-style Integrity Tree in Secure NVM
Mengya Leia, Fang Wangb, Dan Fengc, Fan Lid and Jie Xue
Wuhan National Laboratory for Optoelectonics, Key Laboratory of Information Storage System, Engineering Research Center of Data Stirage System and Technology, Ministry of Education of China, School of Computer Science & Technology Huazhong University of Science and Technology
almy_up@hust.edu.cn
bwangfang@hust.edu.cn
cdfeng@hust.edu.cn
dlfhust@hust.edu.cn
exujie_dsal@hust.edu.cn
ABSTRACT
The integrity tree is a crucial part of the secure non-volatile memory (NVM) system design. For NVM with Large capacity, The SGX-style Integrity tree(SIT) is Practical due to its parallel Updates and variable arity. However, employing Sit in Secure NVM is not easy. This is because the secure metadata SIT must be strictly persisted or restored after a sudden Power loss, Which unfortunately incurs unacceptable run-time overhead or recovery time. in this paper, we propose PSIT, a metadata persistency solution for SIT-protected Secure NVM with high Performance and fast restoration. PSIT utilizes the observation that for a lazily updated SIT, the lost tree nodes after a crash can be recovered by the corresponding child nodes in the NVM. it reduces The persistency overhead of the SIT nodes Through a restrained write back meta-cache and leverages the SIT inter layer Dependency for recovery. Experiments Show that compared to ASIT, a state-of-the-art secure NVM using SIT, PSIT Decreases write Trafic by 47% and improves the performance bt 18% on average while maintaining an acceptable recovery time.
