|
|
|
     |
                                     |
Return to Data Security and Protection
Protecting rights over 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 for rights protection are available, each with its own advantages and drawbacks. Enforcement by legal means is usually ine ective in preventing theft of copyrighted works, unless augmented by a digital counter-part, for example watermarking. Recent research of the authors introduces the issue of digital watermarking for generic number sets. In the present paper we expand on this foundation and introduce a solution for relational database content rights protection through watermarking. Our solution addresses important attacks, such as data re-sorting, subset selection, linear data changes (applying a linear transformation on arbitrary subsets of the data). Our watermark also survives up to 50% and above data loss. Finally we present wmdb.*, a proof-of-concept implemen- tation of our algorithm and its application to real life data, namely in watermarking the outsourced Wal-Mart sales data that we have available at our institute.
@inproceedings {DBLP:conf/sigmod/SionAP03, author = {Radu Sion and Mikhail J. Atallah and Sunil Prabhakar}, booktitle = {SIGMOD Conference}, title = {Rights Protection for Relational Data.}, pages = {98-109}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#SionAP03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r04p03.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
