Dynamic Graph-Based Software Watermarking – CT Algorithm: Analysis, Improvement and Application in Java

• Main Authors: Tze-lap Hon, 韓子立
• Other Authors: Tien-Ruey Hsiang
• Format: Others
• Language: en_US
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/35083753207335613295

碩士 === 國立臺灣科技大學 === 資訊工程系 === 95 === Software watermarking is an important technique that enables the protection of programs and intellectual property rights. In this thesis, we discuss the development of software watermarks and the problems involved in dynamic graph-based software watermarking when applying CT algorithm is applied to Java technology. Because Java differs from traditional programming languages, we use the object-oriented analysis and design approach to solve these problems. By embedding watermarks into the input sequences on objects with strong relation, we can prevent watermark tempering. Our experimental results demonstrate that our approach not only effectively increases the difficulty and time required to tamper watermarks but also reduces memory usage and the resources required for loading these watermarks.