Protection of Dynamic Graph Watermark Based on Multiple Constants Encoding
Zhu Jiang-tao · Computer and Modernization · 2009
In comparison with general static watermark,dynamic graph software watermark shows great superiority in terms of anti-attack.Therefore hackers can find the structure of the watermark and destruct the watermark through completely analyzing the watermarked program and bring a failure to the retrieval process.This paper presents an idea of protecting dynamic graph software watermark based on Asmuth-Bloom system.In this algorithm,the idea of the secret sharing to the software watermarking is introduced,which divides the watermark information into several parts.The watermark recovering based on incomplete content is realized.Finally,through experiments on embedded overload robustness,it illustrates that this algorithm is resilient against dewatermarking attacks such as code optimization and code obfuscation,but it has a lower data rate,more time and space are needed during the progress of recovering the watermark information.