An Improved Dynamic Graph Watermark Algorithm

By studying the characteristic of traditional graph encoding, we found two critical shortages: the first is that graph encoding efficiency is lower, the second is that graph topology is independent from the host which means all the graph encodings are lack of ability to tamper-proofing. This paper presents a novel extend dynamic graph encoding algorithm to overcome the shortages mentioned above. we make full use of all nodes to encoding to solve the first shortages, then base on new encoding scheme we propose a constant encoding scheme to produce a closer dependency between the topology with the host to get a self-tamper-proofing algorithm. The advantage of this algorithm is that not only greatly improves the coding efficiency, but also can effectively resist conspiracy attacks, tamper attacks and immune from most obfuscation attacks.