Signature hiding and recovery in a graph coloring solutions using modified genetic algorithm

Intellectual Property Protection or IPP is an act of protecting a digital product by embedding an author´s signature into the object in the form of minute errors. This signature will be the proof of ownership. However, this technique cannot be directly applied to protect intellectual properties such as solutions to hard problems which must maintain the correct functionality. This paper proposes a constraint-based watermarking technique and lays out a theoretical framework to evaluate this type of technique. Based on this framework, we analyze previously proposed two watermarking techniques for the graph coloring problem because of its theoretical importance in complexity theory and numerous applications in real life. This newly proposed algorithm is the another way to protect graph coloring solution from an intruder by coloring a graph using Modified Genetic Algorithm. We used those colored partitions for the purpose of embedding signature into the graph, so that the developer of the solution can only unhide the signature message from the graph to claim his/her authorship.