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
An abstract interpretation-based framework for software watermarking
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic path-based software watermarking
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
More on graph theoretic software watermarks: Implementation, analysis, and attacks
Information and Software Technology
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 |
We have recently presented an efficient codec system for encoding a watermark number w as a reducible permutation graph F [π*], through the use of self-inverting permutations π* and proposed a dynamic watermarking model, which we named WaterRpg, for embedding the watermark graph F [π*] into an application program P. In this paper, we implement our watermarking model WaterRpg in real application programs, taken from a game database, and evaluate its functionality under various watermarking issues supported by our WaterRpg model. More precisely, we selected a number of Java application programs and watermark them using two main approaches. First, we show in detail a straightforward or naive approach for watermarking a given program P which is based only on the well-defined call patterns of our model, and then we prove structural and programming properties of the call patterns based on which we can watermark the program P in a more stealthy way. The experimental results show the efficient functionality of all the programs P* watermarked under the naive-case and all the stealthy-cases. The size and the time overhead of the propose watermarking are very low.