A Novel Relational Database Watermarking Algorithm

A new watermarking algorithm for relational database which is based on spread spectrum techniques is proposed, to establish that a false positive judgment is highly unlikely by evaluating the similarity of watermarks between the original and the one gotten from the detection step.

Abstract

We propose a new watermarking algorithm for relational database which is based on spread spectrum techniques in this paper. We assign different owners for different identification key to generate the special watermarking signal and insert it into appropriate tuples. At the watermarking detection step, we use the technique of even parity check and majority voting for the watermark accuracy. It is to establish that a false positive judgment is highly unlikely by evaluating the similarity of watermarks between the original and the one gotten from the detection step. Experimental results are also presented to support that it is robust in the present of the various attacks and positive updating such as adding, deleting and modifying.