A Dynamic Graph Software Watermarking Scheme Based on Variable TamperProofing

J4 ›› 2011, Vol. 33 ›› Issue (5): 18-21.

• 论文 • Previous Articles Next Articles

A Dynamic Graph Software Watermarking Scheme Based on Variable TamperProofing

LI Shuzhi,LIU Meng

(School of Information Engineering,Jiangxi University of Science and Technology,Ganzhou 341000,China)

Received:2010-04-06 Revised:2010-08-09 Online:2011-05-25 Published:2011-05-25

Abstract

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

LI Shuzhi,LIU Meng. A Dynamic Graph Software Watermarking Scheme Based on Variable TamperProofing[J]. J4, 2011, 33(5): 18-21.

A Dynamic Graph Software Watermarking Scheme Based on Variable TamperProofing

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 0

Recommended Articles

Metrics

Comments