Advertisement
Published in:
2007 | OriginalPaper | Chapter
A Novel Relational Database Watermarking Algorithm
Authors : Yu Fu, Cong Jin, Chuanxiang Ma
Published in: Intelligence and Security Informatics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.