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

Framework for Fast Memory Authentication Using Dynamically Skewed Integrity Tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…e structure uses a hash tree with multibranch paths, and each node (including the root node) adopts the traversal sorting method of increasing numbers from top to bottom and from left to right. By storing data block information on each node, not just on the leaf node, the utilization rate of each node can be improved [23,24].…”
Section: Improvement Of Data Integrity Verification Mechanismmentioning
confidence: 99%
“…e structure uses a hash tree with multibranch paths, and each node (including the root node) adopts the traversal sorting method of increasing numbers from top to bottom and from left to right. By storing data block information on each node, not just on the leaf node, the utilization rate of each node can be improved [23,24].…”
Section: Improvement Of Data Integrity Verification Mechanismmentioning
confidence: 99%
“…vii Chapter 5 is published in [3] as Vig, Saru, Rohan Juneja, Guiyuan Jiang, Siew-Kei Lam, and Changhai Ou. "Framework for fast memory authentication using dynamically skewed integrity tree."…”
Section: Authorship Attribution Statementmentioning
confidence: 99%
“…The framework is simulated with Multi2Sim and compared with other existing mechanisms to demonstrate its performance and energy benefits. This work has been published in [3].…”
Section: Main Contributionsmentioning
confidence: 99%
See 1 more Smart Citation