Abstract
This paper presents an implementation of the novel watermarking method proposed by Venkatcsan, Vazirani, and Sinha in their recent paper A Graph Theoretic Approach to Software Watermarking. 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 measure the size and time overhead of watermarking, and evaluate the algorithm against a variety of attacks.
Original language | English (US) |
---|---|
Pages (from-to) | 192-207 |
Number of pages | 16 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 3200 |
DOIs | |
State | Published - 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)