Phoenix: Towards Ultra-Low Overhead, Recoverable, and Persistently Secure NVM

Alwadi, Mazen; Zubair, Kazi Abu; Mohaisen, Aziz; Awad, Amro

doi:10.1109/tdsc.2020.3020085

Cited by 17 publications

(7 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For updating root, like BMT, SIT has two update schemes: eager and lazy schemes [2]. The eager scheme immediately propagates the modifications of the leaf nodes to the root once the modified leaf nodes are persisted.…”

Section: E Sgx Integrity Treementioning

confidence: 99%

“…To propagate the modifications from leaf nodes to root, we serially hash tens of HMACs, which incurs a long latency. 2 The inconsistency between root and leaf nodes. Since the write queue in the memory controller is supported by ADR, the write queue is a persistent domain.…”

Section: G the Problem Of Updating Rootmentioning

confidence: 99%

“…SIT fails to be reconstructed from the leaf nodes [2], [9], [36] since reconstructing one SIT node requires its parent node as input. We leverage a counter-summing approach to reconstructing the SIT from leaf nodes up and analyze the security of the proposed scheme.…”

Section: Reconstruct the Sitmentioning

confidence: 99%

“…According to the shadow table, Anubis has the ability to recover both BMT and SIT. Phoenix [2] observed that Anubis needs 2x writes to recover SIT. To reduce the write overhead of recovering SIT, Phoenix relaxes the persistences of counter blocks via Osiris, and recovers the intermediate tree nodes via Anubis.…”

Section: Recovery Schemementioning

confidence: 99%

“…This drawback limits the usage of SIT. In existing SITbased NVM systems [2], [36], one MT constructed in cache or NVM is added outside the SIT, and the root of the MT is used as the trusted base to verify the integrity of data. Some of other integrity-tree works [4], [9] can't be leveraged by the SIT since SIT fails to be reconstructed from leaf nodes.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Huang,

Hua

2021

Preprint

View full text Add to dashboard Cite

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 countersumming approach to reconstructing the SIT from leaf nodes. Our evaluation results show that compared with the state-of-theart integrity tree update schemes, our SCUE scheme delivers high performance while ensuring the system integrity.

show abstract

Section: E Sgx Integrity Treementioning

confidence: 99%

Section: G the Problem Of Updating Rootmentioning

confidence: 99%