2019
DOI: 10.1109/tdsc.2019.2941193
|View full text |Cite
|
Sign up to set email alerts
|

Towards Low-Cost Mechanisms to Enable Restoration of Encrypted Non-Volatile Memories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(13 citation statements)
references
References 31 publications
0
13
0
Order By: Relevance
“…It introduces a counter write coalescing scheme and a cross-bank counter storage to decrease the number and the execution time of write requests, respectively. More effort towards low-overhead encrypted NVMs is presented in Osiris [54], a new memory controller design that provides crash consistency for encryption counters. The number of NVM writes is reduced by eliminating the unnecessary evictions from the counter cache, which waives significant performance overheads.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…It introduces a counter write coalescing scheme and a cross-bank counter storage to decrease the number and the execution time of write requests, respectively. More effort towards low-overhead encrypted NVMs is presented in Osiris [54], a new memory controller design that provides crash consistency for encryption counters. The number of NVM writes is reduced by eliminating the unnecessary evictions from the counter cache, which waives significant performance overheads.…”
Section: Related Workmentioning
confidence: 99%
“…Compiler-support for Critical Data Persistence in NVM54:Pseudo code of the compiler pass code analysis and generation.Input: Loop L in LLVM IR // Innermost loop of the loop-nest tagged by the custom pragma directive isTiled, isPartial // Compile time commandline options targetLoopInductionVariable, targetArrayName[[from:to,]from:to] // Pragma arguments, optional range limits Output: Updated Loop L with necessary flushing one-level (LC flush ) or two-level (LR flush and LC flush ) loop-structure and logging/synchronization instructions for persisting data TargetArray ← get pointer to targetArrayName CLELEMENTS ← Cache line size / sizeOf( * TargetArray) // No. of array elements per cache line N ← Number of elements per row in TargetArray childLoop ← L currentLoop ← L.getParentLoop() // outermostLoop.getDepth() = 1 while currentLoop.getDepth() > 0 do if currentLoop.inductionVariable is targetLoopInductionVariable then codeInsertionPoint ← after last instruction of currentLoop if optionalRangeProvided then fill LR flush .LowerBound, LR flush .UpperBound, LC flush .LowerBound, and LC flush .UpperBound end if isTiled then LR flush ← newLoop() // loop to iterate over multiple rows to be flushed; ex.…”
mentioning
confidence: 99%
“…In this work, we assume a similar threat mode as in state-of-the-art work in secure memory architecture [5,7,8,22,27,28,30,31,33]. The trust base is limited to the processor and its internal structures.…”
Section: Threat Modelmentioning
confidence: 99%
“…Each memory pool implements its own media controller that translates Gen-Z commands into media-specific read and write operations. Processing elements must use the Gen-Z coupled with security features i.e, encryption and integrity verification [5,7,8,30,31,33,34]. While the secure memory implementations are not limited to NVMs due to similar data remanance attacks performed in DRAM i.e., cold boot attack [32], our work is not limited to NVMs as well.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation