2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation 2014
DOI: 10.1109/scam.2014.43
|View full text |Cite
|
Sign up to set email alerts
|

Bit-Level Taint Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 26 publications
(18 citation statements)
references
References 12 publications
0
18
0
Order By: Relevance
“…In order to do this, we use a taint propagation technique which is a well-known and useful analysis tool in the fields of static and dynamic analysis. It turns out that a conventional bytelevel taint analysis is not precise enough for our needs, so we use an enhanced bit-level taint-analysis [17]. This initial computation captures explicit information flow from input to output, but does not capture implicit flows, i.e., associations between data values that arise due to control dependencies rather than data dependencies.…”
Section: A Overviewmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to do this, we use a taint propagation technique which is a well-known and useful analysis tool in the fields of static and dynamic analysis. It turns out that a conventional bytelevel taint analysis is not precise enough for our needs, so we use an enhanced bit-level taint-analysis [17]. This initial computation captures explicit information flow from input to output, but does not capture implicit flows, i.e., associations between data values that arise due to control dependencies rather than data dependencies.…”
Section: A Overviewmentioning
confidence: 99%
“…First, in order to deal with obfuscated code-including obfuscations that scramble together the bits from different words-we maintain and propagate taint information at the level of individual bits. Second, instead of simply indicating taintedness via a single bit, indicating whether or not a location is tainted or not, we keep track of the source of each distinct taint value [17]. Keeping track of taint sources turns out to be very helpful for reasoning about the taint of the result of an operation where both inputs originate from the same value; it turns out that such operations are often used in obfuscated code to construct opaque predicates or constants [23].…”
Section: B Identifying Input-to-output Flowsmentioning
confidence: 99%
“…Rather than observe the program values that are dependent upon the taint sources, backward tainting observes the values which the sinks are dependent upon. [43] introduces a technique of combining forward and backward tainting approaches in order to eliminate program obfuscations and in turn simplify an execution trace. Their approach utilizes different levels of granularity during the taint in order to bypass devious defenses such as those used in [37].…”
Section: Taint Analysismentioning
confidence: 99%
“…However, since taint analysis has strong serial data and control dependencies on the program execution, the parallelized taint analysis need to be frequently synchronized for data communication (e.g., control flow directions and memory addresses), either through customized hardware [31,40] or shared memory [18,19]. The second category first records the application execution and then replay the taint analysis on a different CPU [15,42,45,48]. Similar to the limitation of the first category, the large online logging data is also a barrier to achieving the expected performance gains.…”
Section: Introductionmentioning
confidence: 99%