We present a mechanism for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data. We formulate the watermarking of relational databases as a constrained optimization problem and discuss efficient techniques to solve the optimization problem and to handle the constraints. Watermark decoding is based on a threshold-based technique characterized by an optimal threshold that minimizes the probability of decoding errors. We implemented a proof of concept implementation of our watermarking technique and showed by experimental results that our technique is resilient to tuple deletion, alteration, and insertion attacks. Watermarking Relational Databases Using Optimization Based Techniques
Watermarking in least significant bits(LSB).This technique embeds the watermark bits in the least significant bits of selected attributes of a selected subset of tuple’s. It uses secret key in watermarking. For each tuple’s a secure message, authenticated code is computed using the secret key and tuple’s primary key. The computed MAC is used select candidate tuple’s attributes and the LSB positions in the selected attributes.
Watermarking embeds ownership information in digital content. Watermark describes information tat can be used to prove the ownership of relational database. Here the embedding is hidden tat the presence of watermarking is invisible to the user.