Extraction in software watermarking

  • Authors:
  • William Zhu;Clark Thomborson

  • Affiliations:
  • University of Auckland, Auckland, New Zealand;University of Auckland, Auckland, New Zealand

  • Venue:
  • MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The widespread use of the Internet makes software piracy and unauthorized modification easier and more frequent. Among the many techniques developed for protecting software copyrights is software watermarking which embeds secret messages into software to identify its owners and developers. While digital watermarking for media such as video, audio, and text is a popular research field, software watermarking is still a relatively new scientific area. The key concepts in software watermarking are informal; some are even confusing. Formalizing these fundamental terms would facilitate the research in this field. In this paper, we formally define the following concepts involved in embedding watermarks into and extracting watermarks from a program in software watermarking: embedding, set of candidate watermarks, representative set, representative degree, extracting, extractability, blindly extractability, and representative extracting.Through the concepts of the representative sets and the representative degree of an embedding algorithm and a program, we characterize the intrinsic property of an extractable embedding algorithm for software watermarking. Furthermore, the concept of the representative extracting algorithm is used to show the best thing we can get for a general software watermarking embedding algorithm.