A randomized graph-based scheme for software watermarking

The insertion of watermarks into proprietary objects is a well-known means of discouraging piracy. It works by embedding into the object some (of- ten surreptitious) data meant to disclose the authorship/ownership of the object. Some promising graph-based watermarking schemes to protect the intellectual property of software have been suggested in the literature, and recent efforts have been endeavored to improve their resilience to attacks. Among the pursued attributes of software watermarking solutions is the one referred to as "diver- sity", which is the ability to encode the intended information in many distinct forms, making it harder for an attacker to find and remove it. We introduce a graph-based scheme which achieves a high level of diversity through random- ization, while admitting an efficient, linear-time implementation nonetheless. Resumo.A inserc¸ ˜ ao de marcas d' ´

[1]  Stavros D. Nikolopoulos,et al.  An Embedding Graph-based Model for Software Watermarking , 2012, 2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing.

[2]  S. Wicker.  Error Control Systems for Digital Communication and Storage , 1994 .

[3]  Christian S. Collberg,et al.  Error-correcting graphs for software watermarking , 2003 .

[4]  F. Lemmermeyer.  Error-correcting Codes , 2005 .

[5]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[6]  Christian S. Collberg,et al.  Surreptitious Software - Obfuscation, Watermarking, and Tamperproofing for Software Protection , 2009, Addison-Wesley Software Security Series.

[7]  Michael Purser.  Introduction to error-correcting codes , 1994 .

[8]  Ramarathnam Venkatesan,et al.  A Graph Theoretic Approach to Software Watermarking , 2001, Information Hiding.

[9]  Stavros D. Nikolopoulos,et al.  Multiple encoding of a watermark number into reducible permutation graphs using cotrees , 2012, CompSysTech '12.

[10]  Gang Qu,et al.  Analysis of watermarking techniques for graph coloring problem , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

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

[12]  Katsuro Inoue,et al.  A practical method for watermarking Java programs , 2000, Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000.

[13]  Genevieve Arboit,et al.  A Method for Watermarking Java Programs via Opaque Predicates , 2002 .

[14]  Patrick Cousot,et al.  An abstract interpretation-based framework for software watermarking , 2004, POPL.

[15]  Jayme Luiz Szwarcfiter,et al.  Towards a Provably Resilient Scheme for Graph-Based Watermarking , 2013, WG.

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

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

[18]  Stavros D. Nikolopoulos,et al.  An Efficient Graph Codec System for Software Watermarking , 2012, 2012 IEEE 36th Annual Computer Software and Applications Conference Workshops.