JSBiRTH: Dynamic JavaScript Birthmark Based on the Run-Time Heap

Chan, Patrick; Hui, Lucas Chi Kwong; Yiu, Siu-Ming

doi:10.1109/compsac.2011.60

Cited by 10 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each birthmark focuses on different runtime behaviors of the program. For example, the dynamic birthmarks based on execution path [3], API calls [4], runtime heaps [5], and etc. were proposed.…”

Section: Definition Of the Birthmarksmentioning

confidence: 99%

See 1 more Smart Citation

Improvement of the Dynamic Software Birthmark Process by Reducing the Time of the Extraction

Yokoi¹,

Tamada²

2018

IJNDC

View full text Add to dashboard Cite

It is a quite tough task to detect the stolen programs since there is a quite huge number of programs in the world. The dynamic software birthmarks were proposed to detect the suspects of plagiarisms based on the runtime behavior of the programs. The detection process with the dynamic birthmarks is composed of extraction, and comparison phases. However, the extraction phase spends much time because it requires to prepare the inputs for running the programs. Generally, preparing the inputs requires the understanding about the target programs. Hence, this paper tries to reduce the extraction time without the understanding the programs by using the unit tests. We evaluated the credibility and resilience of properties of the dynamic birthmarks extracted by the proposed method. As a result, the similarities were greater than 0.8 among the newest two versions of the same products. On the other hand, similarities between different projects were under 0.355.

show abstract

Section: Definition Of the Birthmarksmentioning

confidence: 99%

“…The results mean that the proposed method can distinguish the independent projects. 5 https://www.gnu.org/software/diffutils/…”

Section: Evaluation Of Performance For the Dynamic Birthmarksmentioning

confidence: 99%

Improvement of the Dynamic Software Birthmark Process by Reducing the Time of the Extraction

Yokoi¹,

Tamada²

2018

IJNDC

View full text Add to dashboard Cite

show abstract

“…ese methods include techniques of fingerprinting [1,2], watermarking [3][4][5], and software birthmarks [6][7][8][9][10][11]. e watermark has the weaknesses as it can be removed by approaches of code obfuscations and semantic preserving transformation.…”

Section: Introductionmentioning

confidence: 99%

Software Birthmark Usability for Source Code Transformation Using Machine Learning Algorithms

Keqing

Nazir

Kong

et al. 2021

Scientific Programming

View full text Add to dashboard Cite

Source code transformation is a way in which source code of a program is transformed by observing any operation for generating another or nearly the same program. This is mostly performed in situations of piracy where the pirates want the ownership of the software program. Various approaches are being practiced for source code transformation and code obfuscation. Researchers tried to overcome the issue of modifying the source code and prevent it from the people who want to change the source code. Among the existing approaches, software birthmark was one of the approaches developed with the aim to detect software piracy that exists in the software. Various features are extracted from software which are collectively termed as “software birthmark.” Based on these extracted features, the piracy that exists in the software can be detected. Birthmarks are considered to insist on the source code and executable of certain programming languages. The usability of software birthmark can protect software by any modification or changes and ultimately preserve the ownership of software. The proposed study has used machine learning algorithms for classification of the usability of existing software birthmarks in terms of source code transformation. The K-nearest neighbors (K-NN) algorithm was used for classification of the software birthmarks. For cross-validation, the algorithms of decision rules, decomposition tree, and LTF-C were used. The experimental results show the effectiveness of the proposed research.

show abstract