Watermarking Relational Databases Using Optimization-Based Techniques
01 Jan 2008-IEEE Transactions on Knowledge and Data Engineering (IEEE Computer Society)-Vol. 20, Iss: 1, pp 116-129
TL;DR: This paper presents a mechanism for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data and formulate the watermarking of relational databases as a constrained optimization problem and discusses efficient techniques to solve the optimizationproblem and to handle the constraints.
Abstract: Proving ownership rights on outsourced relational databases is a crucial issue in today's 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
Citations
More filters
01 Apr 1997
TL;DR: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity.
Abstract: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.
2,188 citations
TL;DR: A new robust and reversible watermarking approach for the protection of relational databases based on the idea of difference expansion and utilizes genetic algorithm (GA) to improve watermark capacity and reduce distortion.
73 citations
TL;DR: An authentication protocol based on an efficient time-stamp protocol and a blind reversible watermarking method that ensures ownership protection in the field of relational database water marking are designed and proposed.
Abstract: Highlights? An authentication protocol is designed for a reversible watermarking using time-stamp protocol. ? The prediction-error expansion on integers technique is used to achieve reversibility. ? The watermark is detected successfully even most of watermarked relation tuples are deleted. Digital watermarking technology has been adopted lately as an effective solution to protecting the copyright of digital assets from illicit copying. Reversible watermark, which is also called invertible watermark, or erasable watermark, helps to recover back the original data after the content has been authenticated. Such reversibility is highly desired in some sensitive database applications, e.g. in military and medical data. Permanent distortion is one of the main drawbacks of the entire irreversible relational database watermarking schemes. In this paper, we design an authentication protocol based on an efficient time-stamp protocol, and we propose a blind reversible watermarking method that ensures ownership protection in the field of relational database watermarking. Whereas previous techniques have been mainly concerned with introducing permanent errors into the original data, our approach ensures one hundred percent recovery of the original database relation after the owner-specific watermark has been detected and authenticated. In the proposed watermarking method, we utilize a reversible data-embedding technique called prediction-error expansion on integers to achieve reversibility. The detection of the watermark can be completed successfully even when 95% of a watermarked relation tuples are deleted. Our extensive analysis shows that the proposed scheme is robust against various forms of database attacks, including adding, deleting, shuffling or modifying tuples or attributes.
72 citations
Cites background from "Watermarking Relational Databases U..."
...Since most the previous relational database watermarking schemes (Agrawal & Kiernan, 2002; Li & Deng, 2003; Li et al., 2003, 2004, 2008; Shehab et al., 2008; Sion et al., 2004b) suffer from an intrinsic problem, where an attacker can falsely claim ownership, since the previous schemes rely only on…...
[...]
TL;DR: It is shown that unrestricted databases can not be watermarked while preserving trivial parametric queries, and query languages and classes of structures that allow guaranteed watermarking capacity are exhibited, namely local query languages on structures with bounded degree Gaifman graph, and monadic second-order queries on trees or treelike structures.
Abstract: Watermarking allows robust and unobtrusive insertion of information in a digital document. During the last few years, techniques have been proposed for watermarking relational databases or Xml documents, where information insertion must preserve a specific measure on data (for example the mean and variance of numerical attributes).In this article we investigate the problem of watermarking databases or Xml while preserving a set of parametric queries in a specified language, up to an acceptable distortion. We first show that unrestricted databases can not be watermarked while preserving trivial parametric queries. We then exhibit query languages and classes of structures that allow guaranteed watermarking capacity, namely 1) local query languages on structures with bounded degree Gaifman graph, and 2) monadic second-order queries on trees or treelike structures. We relate these results to an important topic in computational learning theory, the VC-dimension. We finally consider incremental aspects of query-preserving watermarking.
59 citations
29 Oct 2008
TL;DR: This paper design an applicable system that would obtain the good quality, acceptable survivability, and reasonable capacity after watermarking, and with the aid of genetic algorithm is designed.
Abstract: Applications for robust watermarking is one of the major branches in digital rights management (DRM) systems and related researches. Based on existing experiences to evaluate the applicability of robust watermarking, it is generally agreed that three parameters or requirements, including the quality of watermarked contents, the survivability of extracted watermark after deliberate or unintentional attacks, and the number of bits embedded, need to be considered. However, performances relating to these three parameters conflict with each other, and the trade off must be searched for. In this paper, we take all the three requirements into consideration, and add the flexibility to meet the specific design in implementation. With the aid of genetic algorithm, we design an applicable system that would obtain the good quality, acceptable survivability, and reasonable capacity after watermarking. Simulation results present the effectiveness in practical implementation and possible application of the proposed algorithm.
57 citations
Cites methods from "Watermarking Relational Databases U..."
...In DRM systems, encryption and robust watermarking are two major schemes for applications (Pan et al. 2004a, 2007; Shehab et al. 2008)....
[...]
References
More filters
Book•
01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Abstract: From the Publisher:
This book brings together - in an informal and tutorial fashion - the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields
Major concepts are illustrated with running examples, and major algorithms are illustrated by Pascal computer programs No prior knowledge of GAs or genetics is assumed, and only a minimum of computer programming and mathematics background is required
52,797 citations
Book•
01 Jan 1975
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Abstract: Name of founding work in the area. Adaptation is key to survival and evolution. Evolution implicitly optimizes organisims. AI wants to mimic biological optimization { Survival of the ttest { Exploration and exploitation { Niche nding { Robust across changing environments (Mammals v. Dinos) { Self-regulation,-repair and-reproduction 2 Artiicial Inteligence Some deenitions { "Making computers do what they do in the movies" { "Making computers do what humans (currently) do best" { "Giving computers common sense; letting them make simple deci-sions" (do as I want, not what I say) { "Anything too new to be pidgeonholed" Adaptation and modiication is root of intelligence Some (Non-GA) branches of AI: { Expert Systems (Rule based deduction)
32,573 citations
Book•
01 Nov 2008TL;DR: Numerical Optimization presents a comprehensive and up-to-date description of the most effective methods in continuous optimization, responding to the growing interest in optimization in engineering, science, and business by focusing on the methods that are best suited to practical problems.
Abstract: Numerical Optimization presents a comprehensive and up-to-date description of the most effective methods in continuous optimization. It responds to the growing interest in optimization in engineering, science, and business by focusing on the methods that are best suited to practical problems. For this new edition the book has been thoroughly updated throughout. There are new chapters on nonlinear interior methods and derivative-free methods for optimization, both of which are used widely in practice and the focus of much current research. Because of the emphasis on practical methods, as well as the extensive illustrations and exercises, the book is accessible to a wide audience. It can be used as a graduate text in engineering, operations research, mathematics, computer science, and business. It also serves as a handbook for researchers and practitioners in the field. The authors have strived to produce a text that is pleasant to read, informative, and rigorous - one that reveals both the beautiful nature of the discipline and its practical side.
17,420 citations
TL;DR: The phrase "direct search" is used to describe sequential examination of trial solutions involving comparison of each trial solution with the "best" obtained up to that time together with a strategy for determining (as a function of earlier results) what the next trial solution will be.
Abstract: In dealing with numerical problems for which classical methods of solution are unfeasible, many people have tried various procedures of searching for an answer on a computer. Our efforts in this direction have produced procedures which seem to have had (for us and for others who have used them) more success than has been achieved elsewhere, so that we have been encouraged to publish this report of our studies. We use the phrase \"direct search\" to describe sequential examination of trial solutions involving comparison of each trial solution with the \"best\" obtained up to that time together with a strategy for determining (as a function of earlier results) what the next trial solution will be. The phrase implies our preference, based on experience, for straightforward search strategies which employ no techniques of classical analysis except where there is a demonstrable advantage in doing so. We have found it worthwhile to study direct search methods for the following reasons: (a) They have provided solutions to some problems, of importance to us, which had been unsuccessfully attacked by classical methods. (Examples are given below.) (b) They promise to provide faster solutions for some problems that are solvable by classical methods. (For example, a method for solving systems of linear equations, proposed in Section 5, seems to take an amount of time that is proportional only to the first power of the number of equations.) (c) They are well adapted to use on electronic computers, since they tend to use repeated identical arithmetic operations with a simple logic. Classical methods, developed for human use, often stress minimization of arithmetic by increased sophistication of logic, a goal which may not be desirable when a computer is to be used. (d) They provide an approximate solution, improving all the while, at all stages of the calculation. This feature can be important when a tentative solution is needed before the calculations are completed. (e) They require (or permit) different kinds of assumptions about the functions involved in various problems, and thus suggest new classifications of functions which may repay study. Direct search is described roughly in Section 2, and explained heuristically in Section 3. Section 4 describes a kind of strategy. Sections 5 and 6 describe
4,184 citations
Book•
01 Jan 1996
TL;DR: This review discusses mathematics, linear programming, and set--Constrained and Unconstrained Optimization, as well as methods of Proof and Some Notation, and problems with Equality Constraints.
Abstract: Preface. MATHEMATICAL REVIEW. Methods of Proof and Some Notation. Vector Spaces and Matrices. Transformations. Concepts from Geometry. Elements of Calculus. UNCONSTRAINED OPTIMIZATION. Basics of Set--Constrained and Unconstrained Optimization. One--Dimensional Search Methods. Gradient Methods. Newton's Method. Conjugate Direction Methods. Quasi--Newton Methods. Solving Ax = b. Unconstrained Optimization and Neural Networks. Genetic Algorithms. LINEAR PROGRAMMING. Introduction to Linear Programming. Simplex Method. Duality. Non--Simplex Methods. NONLINEAR CONSTRAINED OPTIMIZATION. Problems with Equality Constraints. Problems with Inequality Constraints. Convex Optimization Problems. Algorithms for Constrained Optimization. References. Index.
3,283 citations