A Novel Planar IPPCT Tree Structure and Characteristics Analysis

A novel planar IPPCT tree (PIPPCT) that holds higher data rate is presented based on analysis of main topologies characteristics of current dynamic graph watermarking system (DGW). Multiple dimensional IPPCT tree (MIPPCT) model and three ident ity vectors concerning it are constructed and presented, then the effect of these vectors on MIPPCT model is discussed in detail . The results proved that the data rate of MIPPCT tree will increase to a limit with its dimension number n increasing based on equal number of leaves and this limit is also computed. Moreover, it proved that there exists a two dimensional area HArea, when datarate is in this area, dynamic graph watermarking system will take on greater performance.

[1]  Michael Stepp,et al.  Dynamic path-based software watermarking , 2004, PLDI '04.

[2]  Michael Stepp,et al.  The Yoix® scripting language: a different way of writing Java™ applications , 2007 .

[3]  Jasvir Nagra,et al.  Threading Software Watermarks , 2004, Information Hiding.

[4]  Christian S. Collberg,et al.  Software watermarking: models and dynamic embeddings , 1999, POPL '99.

[5]  William Zhu,et al.  Recognition in software watermarking , 2006, MCPS '06.

[6]  Fei-Yue Wang,et al.  A Survey of Software Watermarking , 2005, ISI.

[7]  Jens Palsberg,et al.  Experience with software watermarking , 2000, Proceedings 16th Annual Computer Security Applications Conference (ACSAC'00).

[8]  Zhang Li.  A Survey on Software Watermarking , 2003 .

[9]  William Zhu,et al.  Extraction in software watermarking , 2006, MM&Sec '06.

[10]  I. Goulden,et al.  Combinatorial Enumeration , 2004 .