Watermarking relational database systems
31 Oct 2008-pp 270-274
TL;DR: An efficient database watermarking algorithm based on inserting a binary image watermark in the dasiatimepsila attribute of database tuples is proposed.
Abstract: Watermarking relational databases is an emerging research area that deals with the legal issue of copyright protection of relational databases. In this paper, we propose an efficient database watermarking algorithm based on inserting a binary image watermark in the dasiatimepsila attribute of database tuples. Experimental results demonstrate the robustness of the proposed algorithm against common database attacks.
Citations
More filters
Book•
01 Jan 1992
335 citations
TL;DR: This work presents a novel method for watermarking relational databases for identification and proof of ownership based on the secure embedding of blind and multi-bit watermarks using Bacterial Foraging Algorithm (BFA).
Abstract: The main aspect of database protection is to prove the ownership of data that describes who is the originator of data. It is of particular importance in the case of electronic data, as data sets are often modified and copied without proper citation or acknowledgement of originating data set. We present a novel method for watermarking relational databases for identification and proof of ownership based on the secure embedding of blind and multi-bit watermarks using Bacterial Foraging Algorithm (BFA). Feasibility of BFA implementation is shown in the framed watermarking databases application. Identification of owner is cryptographically made secure and used as an embedded watermark. An improved hash partitioning approach is used that is independent of primary key of the database to secure ordering of the tuples. Strength of BFA is explored to make the technique robust, secure and imperceptible. BFA is implemented to give nearly global optimal values bounded by data usability constraints and thus makes database fragile to any attack. The parameters of BFA are tuned to reduce the execution time. BFA is experimentally proved to be better solution than Genetic Algorithm (GA). The technique proposed is experimentally proved to be resilient against malicious attacks.
28 citations
TL;DR: An extensive survey of the state-of-the-art in reversible watermarking techniques for relational databases is made to reflect recent research progress and to point out the key issues for future research.
Abstract: Over the past few years, reversible watermarking techniques for relational databases have been proposed to provide protection of ownership rights, data tempering, and data integrity. Mainly, these techniques ensure original data recovery from watermarked data, whereas irreversible watermarking schemes only protect ownership rights. This characteristic of reversible watermarking has emerged as a candidate solution for the protection of ownership rights of data, intolerable to modifications such as medical data, genetic data, credit card, and bank account data. The main objective of this paper is to make an extensive survey of the state-of-the-art in reversible watermarking techniques for relational databases to reflect recent research progress and to point out the key issues for future research. In order to analyze these techniques, a classification has been performed on the basis of i the extent of modifications introduced by the watermarking scheme in the underlying data and ii the robustness of the embedded watermark against malicious attacks. Copyright © 2015 John Wiley & Sons, Ltd.
19 citations
Posted Content•
TL;DR: This paper proposes a method, based on image as watermark and this watermark is embedded over the database at two different attribute of tuples, one in the numeric attribute of tuple and another in the date attribute's time (seconds) field.
Abstract: Digital multimedia watermarking technology had suggested in the last decade to embed copyright information in digital objects such as images, audio and video. However, the increasing use of relational database systems in many real-life applications created an ever-increasing need for watermarking database systems. As a result, watermarking relational database system is now emerging as a research area that deals with the legal issue of copyright protection of database systems. The main goal of database watermarking is to generate robust and impersistent watermark for database. In this paper we propose a method, based on image as watermark and this watermark is embedded over the database at two different attribute of tuple, one in the numeric attribute of tuple and another in the date attribute's time (seconds) field. Our approach can be applied for numerical and categorical database.
16 citations
Cites background or methods from "Watermarking relational database sy..."
...[18] which, explains a watermarking method based on first approach but here image is used as watermark and it is embedded in Date attribute’s time field....
[...]
...Therefore, literature in this area has been very limited, and focused on embedding short strings of binary bits in numerical databases [18]....
[...]
...In earlier approach[13][18] author used a single attribute of a tuple to embed a watermark but we are embedding the same watermark in two attributes using our proposed algorithms....
[...]
TL;DR: This paper presents a mechanism that is resilient or insensitive to additive attacks, how to embed and detect watermark in relational database, and can draw graphs and original ownership claim can be resolved.
Abstract: Strengthening the ownership rights on outsourced relational database is very important in today’s internet environment. Especially where sensitive, valuable content is to be outsourced. Let us take an example of university database, weather data, stock market data, power consumption consumer behaviour data, and medical and scientific data. The increasing use of databases in applications beyond “behind–the- firewalls data processing” is creating a need for watermarking relational databases. Watermarking for relational data is made possible by fact that real data can very often tolerate a small amount of errors without any significant degradation with respect to their usability. In this paper, we present a mechanism that is resilient or insensitive to additive attacks, how to embed and detect watermark in relational database. In additive attack the attacker simply inserts his/her own watermark in original data. In our proposed system we can draw graphs and original ownership claim can be resolved by locating the overlapping regions of the two watermarks in which the bit values of the marks conflict and determining which owner’s mark win. The attacker must have inserted the watermark later. Clearly having more marked tuples increases collisions and hence we can easily identify the owner of the data.
16 citations
References
More filters
TL;DR: The authors begin by discussing the need for watermarking and the requirements and go on to discuss digitalWatermarking techniques based on correlation and techniques that are notbased on correlation.
Abstract: The authors begin by discussing the need for watermarking and the requirements. They go on to discuss digital watermarking techniques based on correlation and techniques that are not based on correlation.
789 citations
Journal Article•
TL;DR: A chuck has a chuck body rotatable about an axis and formed with a plurality of angularly spaced radially extending inner guides and a plurality that is radially displaceable in each of the inner guides.
Abstract: A chuck has a chuck body rotatable about an axis and formed with a plurality of angularly spaced radially extending inner guides and a plurality of angularly spaced and radially extending outer guides. An inner jaw part wholly received within the chuck body is radially displaceable in each of the inner guides and an outer jaw part projecting axially from the chuck body is radially displaceable in each of the outer guides. An operating element is engaged with all of the inner jaw parts to jointly radially displace them. A coupling member is axially displaceable in each of the inner jaw parts between a coupling position in which each of the inner parts is locked for joint radial movement with the respective outer part and an axially offset decoupling position allowing relative radial displacement of the outer jaw parts and the respective inner jaw parts. These coupling members may be independently operable, or jointly operable by means of a cam ring.
581 citations
"Watermarking relational database sy..." refers background in this paper
...Such requirements include; maintaining watermarked database usability, preserving database semantics, preserving database structure, watermarked database robustness, blind watermark extraction, and incremental updatability, among many other requirements....
[...]
19 Dec 2005
TL;DR: This paper presents a detailed survey of existing and newly proposed steganographic and watermarking techniques and classify the techniques based on different domains in which data is embedded.
Abstract: Watermarking, which belong to the information hiding field, has seen a lot of research interest. There is a lot of work begin conducted in different branches in this field. Steganography is used for secret communication, whereas watermarking is used for content protection, copyright management, content authentication and tamper detection. In this paper we present a detailed survey of existing and newly proposed steganographic and watermarking techniques. We classify the techniques based on different domains in which data is embedded. We limit the survey to images only.
574 citations
IBM1
TL;DR: The need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for water marking, and provide desirable properties of a watermarked system for relational data are enunciated.
Abstract: We enunciate the need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for watermarking, and provide desirable properties of a watermarking system for relational data. A watermark can be applied to any database relation having attributes which are such that changes in a few of their values do not affect the applications.
We then present an effective watermarking technique geared for relational data. This technique ensures that some bit positions of some of the attributes of some of the tuples contain specific values. The tuples, attributes within a tuple, bit positions in an attribute, and specific bit values are all algorithmically determined under the control of a private key known only to the owner of the data. This bit pattern constitutes the watermark. Only if one has access to the private key can the watermark be detected with high probability. Detecting the watermark neither requires access to the original data nor the watermark. The watermark can be detected even in a small subset of a watermarked relation as long as the sample contains some of the marks.
Our extensive analysis shows that the proposed technique is robust against various forms of malicious attacks and updates to the data. Using an implementation running on DB2, we also show that the performance of the algorithms allows for their use in real world applications.
382 citations
Book•
01 Jan 1992
335 citations
"Watermarking relational database sy..." refers methods in this paper
...In this paper, a binary image is used to watermark a relational database, such that the image is embedded in the 'Time' attributes of selected tuples of the database....
[...]