Research Of Dynamic Software Watermarking Technology Based On R-tree

Since the emergence of the Internet, computer network technology has been developed rapidly, more and more software products have been developed and applied to the People’s Daily life. Meanwhile, people have intention or not intentional to copy software products is increasing, some illegal attacker implement malicious illegal behaviors, such as malicious attacks, tampering, stealing, and so on, which makes the copyright information of software products cannot be effectively protected, not only cause losses to individuals and software companies, also seriously hindered the development of the software industry.Software watermarking is a newly developed, effective technology to product the copyright information of software products. By embedding watermarks that carrier copyright information in the software product program to protect the legitimate rights and interests of software owners. Dynamic data structure software watermarking is a classification of software watermarking technology, currently, it is a research focus in China and abroad. And it is a dynamic software watermark, watermark generation and extraction depends on the dynamic execution state of the program, therefore, the watermark information is difficult to locate, capture, analyze and thus make the attacks, tampering, stealing become more and more difficult.Improved dynamic software watermarking algorithm based on R-tree, combined with software watermark-sharing scheme based on m-n Variable Carrying Rule, thereby increased the data rate of the watermark and the tamper-proof capability. This paper made a specific study of the following aspects:1. Basic theoretical of software watermarking technology are introduced, including the overview of the software watermarking, general model, classification, attack type and the performance evaluation standards of software watermarking.2. In this paper, the dynamic software watermarking technology based on R-tree are analyzed and researched, analysis the R-tree data structure, properties the related algorithms. Put forward the basis to design dynamic software watermarking based on R-tree, use the redundancy of the sequence of entries inside R-tree nodes to hide the watermark information; and to analysis the impact of the operations of search, insert, separation, delete and merge to the software watermark.3. Proposed a new dynamic software watermarking scheme based on R-tree data structure, at first, this scheme use the m-n Variable Carrying Rule to pretreat the watermark, and use VF-NS encoding system to encode watermark achieve one mapping between the watermark value and the sequence of the entries inside R-tree nodes, give a specific watermark embedding and extracting algorithms, and embedded the sub-watermarks to the R-tree nodes.4. Experimented and analyzed the anti-attack capability, tamper-proof capability, data rate and overload performance, theoretical analysis and experimental results show this scheme has good performance in data rate and tamper-proof capability.