[attachment=9907]
Hiding Relational Databases with optimization Based Techniques
Abstract
• 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.
• A watermark describes information that can be used to prove the ownership of data such as the owner, origin, or recipient of the content.
• We develop an efficient technique for watermark detection that is based on an optimal threshold.
• The optimal threshold is selected by minimizing the probability of decoding error.
Existing System
• Watermarking techniques have emerged as an important building block that plays a crucial role in addressing the ownership problem.
• Such techniques allow the owner of the data to embed an imperceptible watermark into the data.
• A watermark describes information that can be used to prove the ownership of data such as the owner, origin, or recipient of the content.
• Secure embedding requires that the embedded watermark must not be easily tampered with, forged, or removed from the watermarked data.
Disadvantage
• The hackers can easily access the data
• No security measures are provided
Proposed System
• We present a watermarking technique for relational data that is highly resilient compared to these techniques.
• Our proposed technique is resilient to tuple deletion, alteration, and insertion attacks.
• Formulate the watermarking of relational databases as a constrained optimization problem and discuss efficient techniques to handle the constraints.
• There are two techniques to solve the formulated optimization problem based on genetic algorithms and pattern search techniques.
• Proposed system present a data partitioning technique that does not depend on marker tuples to locate the partitions and, thus, it is resilient to watermark synchronization errors.
• We develop an efficient technique for watermark detection that is based on an optimal threshold.
• The optimal threshold is selected by minimizing the probability of decoding error.
Advantages
• Since the data transmission is hidden, the data cannot be hacked
• Watermarking technique is an added advantage
• Permissions are specified
Software Requirements
• Operating System : Windows XP professional
• Front End : Microsoft Visual Studio .Net 2005
• Language : Visual C# .Net
• Back End : SQL Server 2000
Hardware Requirements:
Processor : Pentium III / IV
Hard Disk : 40 GB
Ram : 256 MB
Monitor : 15VGA Color
Mouse : Ball / Optical
Keyboard : 102 Keys