Watermarking Relational Databases using Optimization Based Techniques

Get BibTex-formatted data

Download

PDF

Author

Mohamed Shehab, Elisa Bertino, Arif Ghafoor

Tech report number

CERIAS TR 2006-41

Entry type

article

Abstract

Proving ownership rights on outsourced relational databases is a crucial issue in today 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 discuss 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 partitioning approach that does not require marker tuples. 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 tuple deletion, alteration and insertion attacks.

Download

PDF

Institution

Purdue University

Key alpha

TKDE

Affiliation

Electrical and Computer Engineering, Computer Science, Electrical and Computer Engineering

Publication Date

2001-01-01

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Article{ TKDE,
	title = "Watermarking Relational Databases using Optimization Based Techniques",
	author = "Mohamed Shehab, Elisa Bertino, Arif Ghafoor",
	institution = "Purdue University",
	abstract = "Proving ownership rights on outsourced relational databases is a crucial issue in today 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 discuss
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 partitioning approach that does not require marker tuples. 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 tuple deletion, alteration and insertion attacks.",
	affiliation = "Electrical and Computer Engineering, Computer Science, Electrical and Computer Engineering",
}