More on graph theoretic software watermarks: implementation, analysis, and attacks

• Autores: Christian Collberg, Andrew Huntwork, Edward Carter, Gregg Townsend, Michael Stepp
• Localización: Information and software technology, ISSN 0950-5849, Vol. 51, Nº 1, 2009, págs. 56-67
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper [R. Venkatesan, V. Vazirani, S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, Pittsburgh, PA, 2001]. An executable program is marked by the addition of code for which the topology of the control-flow graph encodes a watermark. We discuss issues that were identified during construction of an actual implementation that operates on Java bytecode. We present two algorithms for splitting a watermark number into a redundant set of pieces and an algorithm for turning a watermark number into a control-flow graph. We measure the size and time overhead of watermarking, and evaluate the algorithm against a variety of attacks.