Abstract:

In order to improve the robustness of software watermarking and the quantity of hidden information, a dynamic graph software watermarking scheme based on variable tamperproofing is  put forward. The big watermark is  split into a set of small watermarks and they are represented as a set of graphs, which are  embedded into the program dynamically. The paper encodes the watermark with a parent pointer of the dynamic graph node, and combines graph nodes and the original grogram variables for tamperproofing. The results of experiment show that the watermark is not obviously effective in changing the program speed and results, and can  resist many types of attacks.

Key words: software watermarking;tamper resistance;split;dynamic graph