|
|
|
     |
                                     |
Return to Security and Privacy
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XML documents, where information insertion must preserve a specific measure on data (e.g. mean and variance of numerical attributes.) In this paper 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 frst observe that unrestricted databases cannot 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 tree-like 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.
@inproceedings {DBLP:conf/pods/Gross-Amblard03, author = {David Gross-Amblard}, booktitle = {PODS}, title = {Query-preserving watermarking of relational databases and XML documents.}, pages = {191-201}, year = {2003}, url = {db/conf/pods/pods2003.html#Gross-Amblard03}, ee = {http://doi.acm.org/10.1145/773153.773172}, crossref = {conf/pods/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
