Recently, we have presented a dynamic watermarking model, which we named WaterRpg, for embedding a reducible permutation graph F [π * ] into an application program P . The main idea behind the proposed watermarking model is to modify the dynamic call-graph G(P, I key ) of the program P , taken by the specific input I key , so that the dynamic callgraph G(P * , I key ) of the resulting watermarked program P * and the the reducible permutation graph F [π * ] are isomorphic; within this idea the program P * is produced by only altering appropriate calls of specific functions of the input application program P . Our model belongs to execution trace watermarks category. In this paper, we implement our WaterRpg watermarking model on several Java application programs and evaluate it under various criteria in order to gain information about its practical behavior. More precisely, we selected a number of Java application programs and watermark them using two main watermarking approaches supported by our WaterRpg model, namely naive and stealthy approachs. The experimental results show the stable functionality of all the Java programs P * watermarked under both the naive and stealthy cases. The experiments also show that the watermarking approaches supported by our model can help develop efficient watermarked Java programs with respect to resilience, size, time, space, and other watermarking metrics.
Abstract:Software watermarking involves embedding a unique identifier or, equivalently, a watermark value, within a software to discourage software theft; towards the embedding process, several graph theoretic watermarking algorithmic techniques encode the watermark values as graph structures and embed them in application programs. Recently, we presented an efficient codec system for encoding a watermark number w as a reducible permutation graph F[π * ] through the use of self-inverting permutations π * . In this paper, we propose a dynamic watermarking model for embedding the watermark graph F[π * ] into an application program P. The main idea behind the proposed watermarking model is a systematic use of appropriate calls of specific functions of the program P. More precisely, our model uses the dynamic call-graph G(P, I key ) of the program P, taken by the specific input I key , and the graph F[π * ], and produces the watermarked program P * having the following key property: its dynamic call-graph G(P * , I key ) and the reducible permutation graph F[π * ] are isomorphic graphs. Within this idea the program P * is produced by only altering appropriate real-calls of specific functions of the input program P. Moreover, the proposed watermarking model incorporates such properties which cause it resilient to attacks.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.