Software watermarking: models and dynamic embeddings
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Secure, Robust Watermark for Multimedia
Proceedings of the First International Workshop on Information Hiding
A Graph Theoretic Approach to Software Watermarking
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Dynamic path-based software watermarking
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Software watermarking via opaque predicates: Implementation, analysis, and attacks
Electronic Commerce Research
More on graph theoretic software watermarks: Implementation, analysis, and attacks
Information and Software Technology
Encoding watermark integers as self-inverting permutations
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Software Watermarking Algorithm Based on Register Allocation
DCABES '10 Proceedings of the 2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science
An Efficient Graph Codec System for Software Watermarking
COMPSACW '12 Proceedings of the 2012 IEEE 36th Annual Computer Software and Applications Conference Workshops
| Hi-index | 0.00 |
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, Ikey) of the program P, taken by the specific input Ikey, so that the dynamic call-graph G(P*, Ikey) 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.