2021
DOI: 10.1109/tifs.2021.3050051
|View full text |Cite
|
Sign up to set email alerts
|

Hunting Vulnerable Smart Contracts via Graph Embedding Based Bytecode Matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 54 publications
(20 citation statements)
references
References 22 publications
0
20
0
Order By: Relevance
“…The potential financial losses incurred by smart contract vulnerabilities have raised a lot of concern [130]. It has been confirmed that matching-based finding methods extrapolating recognized vulnerabilities to unknowns can be effective on other platforms.…”
Section: Vulnerability Huntingmentioning
confidence: 96%
See 1 more Smart Citation
“…The potential financial losses incurred by smart contract vulnerabilities have raised a lot of concern [130]. It has been confirmed that matching-based finding methods extrapolating recognized vulnerabilities to unknowns can be effective on other platforms.…”
Section: Vulnerability Huntingmentioning
confidence: 96%
“…A direct adoption of the technology to smart contracts is, however, hampered by two issues, namely, variety in byte-code generation causing from fast development of compilers and interference of noise code simply produced by the uniform business logic. As a solution, the author of [130] propose byte-code-oriented standardization and part techniques to enhance byte code matching [130].…”
Section: Vulnerability Huntingmentioning
confidence: 99%
“…Liu et al [23] used the method of birthmarks on the decompiled bytecode for similarity detection. Huang [45] decompiles the bytecode, slices the instruction and embeds the similarity of the matching bytecode in the graph network.…”
Section: Related Workmentioning
confidence: 99%
“…As a result, the compiled bytecodes with the same logic are diverse and noisy. To solve this problem, Huang et al [121] labeled the data and reorder the opcodes. This process ignores all irrelevant instructions, then it analyzes the bytecode execution process and slices the data by the label to reduce the noise impact of meaningless code.…”
Section: Figure 3 Schematic Diagram Of Ilf Process Frameworkmentioning
confidence: 99%