arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.03502cs.CR
收藏

安全非易失性存储系统中完整性树根的低开销更新

Update the Root of Integrity Tree in Secure Non-Volatile Memory Systems with Low Overhead

Jianming Huang, Yu Hua

摘要:

数据完整性对于即使在没有电力的情况下也维持数据的非易失性存储器(NVM)系统是重要的。NVM中的数据完整性可能会受到完整性攻击的危害,可以通过完整性树进行完整性验证来防御。在NVM系统故障和重启之后,完整性树根负责提供可信执行环境。然而,根经常成为性能瓶颈,因为更新根需要在写入关键路线上的高延迟以将修改从叶节点传播到根。根节点和叶节点必须确保彼此之间的崩溃一致性,以避免任何更新失败,这可能导致系统重启后误报攻击。在本文中,我们提出了一个高效和低延迟的计划,称为SCUE,直接更新SGX完整性树(SIT)上的根忽略更新的中间树节点。SCUE背后的思想探索并利用了这样一种观察:由于缓存的中间树节点丢失,只有持久的叶节点和根节点才能在系统故障和重启后确保完整性。为了实现根节点和叶节点之间的崩溃一致性,我们准确地预测根节点上的更新,并在叶节点被修改之前预先更新根节点。此外,由于更新一个树节点需要其父结点作为输入,因此难以从叶节点重建SIT根。我们使用一个反求和的方法来重建叶节点的SIT。我们的评估结果表明,与国家的最先进的完整性树更新计划相比,我们的SCUE计划提供了高性能,同时确保系统的完整性。

英文摘要:

Data integrity is important for non-volatile memory (NVM) systems that maintain data even without power. The data integrity in NVM is possibly compromised by integrity attacks, which can be defended against by integrity verification via integrity trees. After NVM system failures and reboots, the integrity tree root is responsible for providing a trusted execution environment. However, the root often becomes a performance bottleneck, since updating the root requires high latency on the write critical path to propagate the modifications from leaf nodes to the root. The root and leaf nodes have to ensure the crash consistency between each other to avoid any update failures that potentially result in misreporting the attacks after system reboots. In this paper, we propose an efficient and low-latency scheme, called SCUE, to directly update the root on the SGX integrity tree (SIT) by overlooking the updates upon the intermediate tree nodes. The idea behind SCUE explores and exploits the observation that only the persistent leaf nodes and root are useful to ensure the integrity after system failures and reboots, due to the loss of the cached intermediate tree nodes. To achieve the crash consistency between root and leaf nodes, we accurately predict the updates upon the root and pre-update the root before the leaf nodes are modified. Moreover, the SIT root is difficult to be reconstructed from the leaf nodes since updating one tree node needs its parent node as input. We use a counter-summing approach to reconstructing the SIT from leaf nodes. Our evaluation results show that compared with the state-of-the-art integrity tree update schemes, our SCUE scheme delivers high performance while ensuring the system integrity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑