A robust algorithm for watermark numeric relational databases

This paper studies a novel method for watermarking relational databases for copyright protection. A novel technique to insert and detect watermarks using a mark bit position is proposed, together with a decision-making algorithm by pattern matching. Experimental results show that the proposed scheme is robust against various forms of attacks.

[1]  Radu Sion,et al.  On Watermarking Numeric Sets , 2002, IWDW.

[2]  Radu Sion,et al.  Rights Protection for Relational Data , 2004, IEEE Trans. Knowl. Data Eng..

[3]  Jianmin Wang,et al.  An Improved Algorithm to Watermark Numeric Relational Data , 2005, WISA.

[4]  David Gross-Amblard,et al.  Query-preserving watermarking of relational databases and XML documents , 2003, PODS '03.

[5]  Min Huang,et al.  A new watermark mechanism for relational data , 2004, The Fourth International Conference onComputer and Information Technology, 2004. CIT '04..

[6]  Peter J. Haas,et al.  Watermarking relational data: framework, algorithms and analysis , 2003, The VLDB Journal.

[7]  Robert H. Deng,et al.  A Block Oriented Fingerprinting Scheme in Relational Database , 2004, ICISC.

[8]  F. Hartung,et al.  Multimedia watermarking techniques : Identification and protection of multimedia information , 1999 .

[9]  Frank Hartung,et al.  Multimedia watermarking techniques , 1999, Proc. IEEE.

[10]  Sushil Jajodia,et al.  Fingerprinting relational databases: schemes and specialties , 2005, IEEE Transactions on Dependable and Secure Computing.