A weighted algorithm for watermarking relational databases

A weighted algorithm for watermarking relational databases for copyright protection is presented. The possibility of watermarking an attribute is assigned according to its weight decided by the owner of the database. A one-way hash function and a secret key known only to the owner of the data are used to select tuples and bits to mark. By assigning high weight to significant attributes, the scheme ensures that important attributes take more chance to be marked than less important ones. Experimental results show that the proposed scheme is robust against various forms of attacks, and has perfect immunity to subset attack.

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

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

[3]  Sushil Jajodia,et al.  Constructing a virtual primary key for fingerprinting relational data , 2003, DRM '03.

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

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

[6]  Rakesh Agrawal,et al.  Watermarking Relational Databases , 2002, Very Large Data Bases Conference.

[7]  Radu Sion,et al.  Rights protection for relational data , 2003, IEEE Transactions on Knowledge and Data Engineering.