Encoding watermark numbers as cographs using self-inverting permutations

Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. In this paper we extended the class of graphs which can be efficiently used in a software watermarking system by proposing an efficient codec system, i.e., encoding and decoding algorithms that emendextract watermark values intofrom cographs through the use of self-inverting permutations. More precisely, we present a codec system which takes as input an integer w as watermark value, converts it into a self-inverting permutation π∗ , and then encodes the permutation π∗ as a cograph. The main property of our codec system is its ability to encode the same integer w, using a self-inverting permutation π∗ , into more than one cograph. This property cause our system resilience to attacks since it can embed multiple copies of the same watermark number w into an application program. Moreover, the proposed co...

• Type: Journal
• Year: 2011
• Where: COMPSYSTECH
• Authors: Maria Chroni, Stavros D. Nikolopoulos
• Keywords: COMPSYSTECH 2011, Graph Structures, Hardware, System Resilience, Time Complexity