Rights protection for relational data.pdfVIP

Rights Protection for Relational Data Radu Sion, Mikhail Atallah, Fellow, IEEE, and Sunil Prabhakar Abstract—In this paper, we introduce a solution for relational database content rights protection through watermarking. Rights protection for relational data is of ever-increasing interest, especially considering areas where sensitive, valuable content is to be outsourced. A good example is a data mining application, where data is sold in pieces to parties specialized in mining it. Different avenues are available, each with its own advantages and drawbacks. Enforcement by legal means is usually ineffective in preventing theft of copyrighted works, unless augmented by a digital counterpart, for example, watermarking. While being able to handle higher level semantic constraints, such as classification preservation, our solution also addresses important attacks, such as subset selection and random and linear data changes. We introduce wmdb.*, a proof-of-concept implementation and its application to real-life data, namely, in watermarking the outsourced Wal-Mart sales data that we have available at our institute. Index Terms—Rights protection, relational data, watermarking, information hiding.
1 INTRODUCTION THEmain purpose of Digital Watermarking is to protect acertain content from unauthorized duplication and distribution by enabling provable ownership over the content. It has traditionally [6], [12], [18] relied upon the availability of a large noise domain within which the object can be altered while retaining its essential properties. For example, the least significant bits of image pixels can be arbitrarily altered with little impact on the visual quality of the image (as perceived by a human). In fact, much of the “bandwidth” for inserting watermarks (such as in the least significant bits) is due to the inability of human sensory system (especially sight and hearing) to detect certain changes. More recently, the focus of watermarking for digital rights protection