Watermarking relational databases using optimization based techniques

133Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

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. © 2007 IEEE.

Cite

CITATION STYLE

APA

Shehab, M., Bertino, E., & Ghafoor, A. (2008). Watermarking relational databases using optimization based techniques. IEEE Transactions on Knowledge and Data Engineering, 20(1), 116–129. https://doi.org/10.1109/TKDE.2007.190668

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free