Proceedings of the 25th International Symposium on Research in Attacks, Intrusions and Defenses 2022
DOI: 10.1145/3545948.3545956
|View full text |Cite
|
Sign up to set email alerts
|

BinProv: Binary Code Provenance Identification without Disassembly

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 17 publications
0
12
0
Order By: Relevance
“…Therefore, the classification performance of our method when the machine code is compressed or obfuscated is unknown. Experiments have confirmed that BinProv performs well for simple obfuscations such as instruction substitution [6]. However, they claim that multiple obfuscations are very difficult to classify, and our method is expected to be very difficult as well.…”
Section: Limitationmentioning
confidence: 63%
See 4 more Smart Citations
“…Therefore, the classification performance of our method when the machine code is compressed or obfuscated is unknown. Experiments have confirmed that BinProv performs well for simple obfuscations such as instruction substitution [6]. However, they claim that multiple obfuscations are very difficult to classify, and our method is expected to be very difficult as well.…”
Section: Limitationmentioning
confidence: 63%
“…As a result, they confirmed that the classification performance is better with raw byte strings than with encoded input data, provided that the input data is of a certain length. Their experimental results show the possibility of supporting multiple CPU architectures simultaneously by using raw input data, which is demonstrated by BinProv [6], described next.…”
Section: B Compiler Provenace Recovery For Multi-cpu Architecturementioning
confidence: 95%
See 3 more Smart Citations