28-05-2014, 03:46 PM
Watermarking Relational Database Using Optimization- Based Techniques
Watermarking Relational Database .pdf (Size: 83.83 KB / Downloads: 8)
ABSTRACT
Abstract
Proving ownerships rights on outsourced relational database is a crucial issue in today's internet
based application environments and in many content distribution applications.
In this paper, 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 discus efficient techniques to
solve the optimization problem and to handle the constraints.
Our watermarking technique is resilient to watermark synchronization errors because it uses a
portioning approach that does not require marker topple. Our approach overcomes a major
weakness in previously proposed watermarking techniques.
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 duple deletion,alteration and
insertion attacks.
Existing System:
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.
Proposed System:
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.