2009
DOI: 10.1016/j.jss.2008.11.848
|View full text |Cite
|
Sign up to set email alerts
|

A static API birthmark for Windows binary executables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
42
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(42 citation statements)
references
References 28 publications
0
42
0
Order By: Relevance
“…In addition, Park et al proposed a static API-call-based birthmark for software theft detection of Java applications [26]. Choi et al additionally presented a static API birthmark for Windows execution files using a set of API calls identified as being static by a disassembler [27]. In addition to the above static birthmarkgeneration techniques, several dynamic API-based birthmarks have been proposed.…”
Section: Api-based Birthmarksmentioning
confidence: 99%
“…In addition, Park et al proposed a static API-call-based birthmark for software theft detection of Java applications [26]. Choi et al additionally presented a static API birthmark for Windows execution files using a set of API calls identified as being static by a disassembler [27]. In addition to the above static birthmarkgeneration techniques, several dynamic API-based birthmarks have been proposed.…”
Section: Api-based Birthmarksmentioning
confidence: 99%
“…Unlike software watermarks, there is no need for prior information embedding; features unique to the program are taken from the compiled binary and defined as the birthmark. Several different types of birthmark that focus on a different program features have been proposed [3][4][5][6][7][8].…”
Section: Related Workmentioning
confidence: 99%
“…The extracted elements are maintained in a structure such as a set, sequence or graph, and the similarity computation method is defined in accordance with the structure used. For example, the Jaccard index [7], Dice's coefficient [4] or cosine similarity [6] are often used for sets, and the longest common subsequence [5,8] is used for sequences. Methods for graphs are more complex; however, methods using graph isomorphism have been proposed [3,9].…”
Section: Related Workmentioning
confidence: 99%
“…But these approaches [7,8] ignore the frequency of API calls in the sequences and suffer from the same problem as normal signature approaches and become similar to signature based approach resulting in a more false positives outcome [9]. Windows Application Program Interface (API) function calls [10][11][12]10] have been used in statistical N-gram modeling techniques [11,12] for detection. However these approaches [11,12] use simple wrapper classification methods [13] which did not explore the ways of selecting the best set of APIs from a large set of APIs.…”
Section: Introductionmentioning
confidence: 99%