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

Authors:
Christian Collberg;Andrew Huntwork;Edward Carter;Gregg Townsend;Michael Stepp
Affiliations:
Department of Computer Science, The University of Arizona, Tucson, AZ 85721, United States;Amazon.com, 1200 12th Ave S., Suite 1200, Seattle, WA 98144, United States;Department of Mathematics, University of California, Berkeley, CA 94720, United States;Department of Computer Science, The University of Arizona, Tucson, AZ 85721, United States;Department of Computer Science, University of California, San Diego, La Jolla, CA 92093, United States
Venue:
Information and Software Technology
Year:
2009

Citing 12
Cited 5

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Manufacturing cheap, resilient, and stealthy opaque constructs

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Compiler techniques for code compaction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Alto: a link-time optimizer for the Compaq alpha

Software—Practice & Experience
Robust Object Watermarking: Application to Code

IH '99 Proceedings of the Third International Workshop on Information Hiding
A Graph Theoretic Approach to Software Watermarking

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Breaking Abstractions and Unstructuring Data Structures

ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
Sandmark--A Tool for Software Protection Research

IEEE Security and Privacy
Dynamic path-based software watermarking

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Graph theoretic software watermarks: implementation, analysis, and attacks

IH'04 Proceedings of the 6th international conference on Information Hiding

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
Encoding watermark numbers as cographs using self-inverting permutations

Proceedings of the 12th International Conference on Computer Systems and Technologies
Multiple encoding of a watermark number into reducible permutation graphs using cotrees

Proceedings of the 13th International Conference on Computer Systems and Technologies
Evaluating the WaterRpg software watermarking model on Java application programs

Proceedings of the 17th Panhellenic Conference on Informatics
Watermarking Java application programs using the WaterRpg dynamic model

Proceedings of the 14th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.