hi ,

i have selected the below project title.
Water Marking Relational Databases Using Optimization technique
Can anyone please Guide/advise me about this project title . Technology :Java Database : Oracle....

Thanks a lot

Regards
Shiek

Watermarking Relational Databases using Optimization Based Techniques

Watermarking techniques have emerged as animportant building
block which plays a crucial role in addressing the ownership
problemIn this article we describe a mechanism for proof of
ownership based on the secure embedding of a robust imperceptible
watermark in relational data.Earlier, Proving ownership rights
on outsourced relational databases was a critical issue in
internet-based application environments and in many content
distribution applications. This watermarking technique is
immune to watermark synchronization errors because it uses a
partitioning approach that does not require marker tuples. This
technique overcomes a major drawback of previous methods in that
Watermark decoding is based on a threshold-based technique
characterized by an optimal threshold that minimizes the
probability of decoding errors. The watermarking of relational
databases is done as a constrained optimization problem, and
efficient techniques to solve the optimization problem and to
handle the constraints are discussed. Experimental results
show that this technique is resilient to alteration, tuple
deletion, and insertion attacks.

Watermarking techniques
A watermark describes information that can be used to prove
the ownership of data. Imperceptible embedding means that the
presence of the watermark is unnoticeable in the data.
Also, the watermark detection is blinded ,that is, it neither
requires the knowledge of the original data nor the watermark.

The approach
A data set D is transformed into a watermarked version DW by
applying a watermark encoding function that also takes as
inputs a secretkey Ks only known to the copyright owner
and a watermark W.Data modifications by watermark
are controlled by providing usability constraints referred to by
the set G.The watermark encoding has the following three steps:
1)Data set partitioning: the data set D is partitioned into m non-overlapping partitions by using key Ks.

2)Watermark embedding: a watermark bit is embedded in
each partition by altering the partition statistics while still verifying
the usability constraints in G.

3)Optimal threshold evaluation: the bit embedding statistics
are used to compute the optimal threshold that minimizes
the probability of decoding error.


Watermark decoding: It is the process of extracting the embedded
watermark using the watermarked data set DW, the secret key Ks
and the optimal threshold. It consists of the following steps:
1)Data set partitioning where the data partitions are generated

2)Threshold based decoding: the statistics of each partition
are evaluated and the embedded bit is decoded using a threshold
based scheme based on the optimal threshold.

3)Majority voting: The watermark bits are decoded using
a majority voting technique.

Genetic algorithm and pattern search techniques are employed to solve
the optimization problem and to handle the constraints.


Seminar report download:
[attachment=730]

hi
even i have selected this topic,if u have the project report kindly share with me..'
thanks

for more about the Water Marking Relational Databases Using Optimization technique

http://studentbank.in/report-water-marki...-technique

http://citeseerx.ist.psu.edu/viewdoc/dow...1&type=pdf

can u please any one send how the algorithms work in this project

Hi Guys

I have selected this topic .... Pl help me with the project report , ppt , pseudo code related to this topic in lang etc....


Vimala

previous page has a report on it. just click on the page link below to see

http://studentbank.in/report-water-marki...37#pid7137

Thanks for ur reply
Can U pl send an example for synthetic or real world data set to check the implementation of watermarking technique

The real-life data set for the purpose of running the experimental simulation was obtained from the relatively small database that contains the daily power consumption rates of some customers over a period of one year. the CIMEG project makes available such kind of data sets. approximately 5 Megabyte is the size of the database. For the experiment, only a subset
of the original data is used with 150000 tuples. The parameters used are:
c=75%,
minimum partition size epsilon=10
no. of partitions m=2048
allowable data change=+/-0.5%
Wateramrk used=16 bit watermark

to minimize the probability of decoding error, a special decodong technique was used. The watermark thus formed was subject to the normal attacks of deletion, alteration, and addition attacks. Multiple runs of the experiment was run and the results of these runs were averaged to obtain the conclusions. both uniform and normally distributed synthetic data were applied to the test and the results obtained.

For more details on the data sets used and the experiments, see:
http://citeseerx.ist.psu.edu/viewdoc/dow...1&type=pdf

Thank u Summer Project Pal

But my problem is i couldnt get the data set form CIMEG.... & i have gone through the paper fully...... If i got that data set
I dont know
1. How to use Optimization tech?
2. what will be the optimization problem and the constraints ?
3. what is synchronization error?
4. what is decoding error?