Proceedings of the 51st Annual Design Automation Conference 2014
DOI: 10.1145/2593069.2593195
|View full text |Cite
|
Sign up to set email alerts
|

Quantitative Analysis of Control Flow Checking Mechanisms for Soft Errors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
7
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(8 citation statements)
references
References 17 publications
1
7
0
Order By: Relevance
“…It means that sometimes is better not protect the application instead of protecting using only a control-flow technique. This result corroborates [24], in which the authors stated that control-flow techniques make the processor more vulnerable to soft errors because they do not provide enough fault coverage to compensate the extra execution time. However, this statement cannot be taken as a rule since the reliability also depends on the target application and processor, as showed by the greater MWTF presented by SETA in 2 out of 3 cases.…”
Section: Mwtf = Amount Of Work Completed Number Of Errors Encounteredsupporting
confidence: 87%
“…It means that sometimes is better not protect the application instead of protecting using only a control-flow technique. This result corroborates [24], in which the authors stated that control-flow techniques make the processor more vulnerable to soft errors because they do not provide enough fault coverage to compensate the extra execution time. However, this statement cannot be taken as a rule since the reliability also depends on the target application and processor, as showed by the greater MWTF presented by SETA in 2 out of 3 cases.…”
Section: Mwtf = Amount Of Work Completed Number Of Errors Encounteredsupporting
confidence: 87%
“…A signature is a binary vector of the form S = (X = (x 1 , x 2 ), f(Y, X)) where x 1 , x 2 and f are 10 bit vectors that represent elements from the finite field F 2 10 . The value of f for k = k max is computed as follows f (Y, X) = y 1 X (0,1) + y 2 X (0,2) + ...y 49 X (0,49) + y 50 X (1,0) + y 51 X (1,1) + ...y 98 X (1,48) + . .…”
Section: Constructionmentioning
confidence: 99%
“…CFC has been proposed to cope with reliability issues for both transient and permanent faults ( [1], [2]) and more recently, with security issues caused by the injection of malicious faults [3], [4], which can allow an attacker to either bypass security checks or retrieve secret information. Software based CFC solutions which modify the code rely on the assumption that the code stored in memory is not being maliciously tampered with and thus cannot provide security [5]; on the other hand, hardware-based CFC solutions, such as [6] can detect malicious code and data tampering at run-time.…”
Section: Introductionmentioning
confidence: 99%
“…The issue of unprotected code is unresolved as all these methods require control transfer information for dynamic shared libraries, which is unknown at compile time. Their fault model is restricted to a limited area of processor like the program counter (PC), parts of few pipeline registers, link registers and so on [27] and thus has poor fault coverage.…”
Section: Related Workmentioning
confidence: 99%