Analysis of watermarking techniques for graph coloring problem
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Software watermarking: models and dynamic embeddings
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Practical Method for Watermarking Java Programs
COMPSAC '00 24th International Computer Software and Applications Conference
A Graph Theoretic Approach to Software Watermarking
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Securing Java through software watermarking
PPPJ '03 Proceedings of the 2nd international conference on Principles and practice of programming in Java
An abstract interpretation-based framework for software watermarking
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Dynamic path-based software watermarking
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Software watermarking via opaque predicates: Implementation, analysis, and attacks
Electronic Commerce Research
A Simple Linear Time LexBFS Cograph Recognition Algorithm
SIAM Journal on Discrete Mathematics
More on graph theoretic software watermarks: Implementation, analysis, and attacks
Information and Software Technology
Encoding watermark integers as self-inverting permutations
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
IH'04 Proceedings of the 6th international conference on Information Hiding
Multiple encoding of a watermark number into reducible permutation graphs using cotrees
Proceedings of the 13th International Conference on Computer Systems and Technologies
| Hi-index | 0.00 |
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 embed/extract watermark values into/from cographs through the use of self-inverting permutations. More precisely, we present a codec system which takes as input an integer ω 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 ω, using a self-inverting permutation π*, into more than one cograph. This property causes our system to be resilient to attacks since it can embed multiple copies of the same watermark number ω into an application program. Moreover, the proposed codec system has low time complexity and can be easily implemented.