Error-correcting graphs for software watermarking

Christian S Collberg, Stephen G Kobourov, Edward Carter, Clark Thomborson

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

In this paper, we discuss graph-theoretic approaches to software watermarking and fingerprinting. Software watermarking is used to discourage intellectual property theft and software fingerprinting is used to trace intellectual property copyright violations. We focus on two algorithms that encode information in software through the use of graph structures. We then consider the different attack models intended to disable the watermark while not affecting the correctness or performance of the program. Finally, we present several classes of graphs that can be used for watermarking and fingerprinting and analyze their properties (resiliency, data rate, performance, and stealthiness).

Original languageEnglish (US)
Pages (from-to)156-167
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2880
StatePublished - 2003

Fingerprint

Watermarking
Fingerprinting
Software
Intellectual property
Intellectual Property
Graph in graph theory
Theft
Resiliency
Watermark
Correctness
Trace
Attack
Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{621d7616190a4ef9bf286474196f9603,
title = "Error-correcting graphs for software watermarking",
abstract = "In this paper, we discuss graph-theoretic approaches to software watermarking and fingerprinting. Software watermarking is used to discourage intellectual property theft and software fingerprinting is used to trace intellectual property copyright violations. We focus on two algorithms that encode information in software through the use of graph structures. We then consider the different attack models intended to disable the watermark while not affecting the correctness or performance of the program. Finally, we present several classes of graphs that can be used for watermarking and fingerprinting and analyze their properties (resiliency, data rate, performance, and stealthiness).",
author = "Collberg, {Christian S} and Kobourov, {Stephen G} and Edward Carter and Clark Thomborson",
year = "2003",
language = "English (US)",
volume = "2880",
pages = "156--167",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Error-correcting graphs for software watermarking

AU - Collberg, Christian S

AU - Kobourov, Stephen G

AU - Carter, Edward

AU - Thomborson, Clark

PY - 2003

Y1 - 2003

N2 - In this paper, we discuss graph-theoretic approaches to software watermarking and fingerprinting. Software watermarking is used to discourage intellectual property theft and software fingerprinting is used to trace intellectual property copyright violations. We focus on two algorithms that encode information in software through the use of graph structures. We then consider the different attack models intended to disable the watermark while not affecting the correctness or performance of the program. Finally, we present several classes of graphs that can be used for watermarking and fingerprinting and analyze their properties (resiliency, data rate, performance, and stealthiness).

AB - In this paper, we discuss graph-theoretic approaches to software watermarking and fingerprinting. Software watermarking is used to discourage intellectual property theft and software fingerprinting is used to trace intellectual property copyright violations. We focus on two algorithms that encode information in software through the use of graph structures. We then consider the different attack models intended to disable the watermark while not affecting the correctness or performance of the program. Finally, we present several classes of graphs that can be used for watermarking and fingerprinting and analyze their properties (resiliency, data rate, performance, and stealthiness).

UR - http://www.scopus.com/inward/record.url?scp=35248820722&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248820722&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35248820722

VL - 2880

SP - 156

EP - 167

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -