David Gross-Amblard
ABSTRACT
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 first observe 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 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.
- R. Agrawal and J. Kiernan. Watermarking Relational Databases. In International Conference on Very Large Databases (VLDB), 2002.]]Google Scholar
- A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. J. of the Association for Computing Machinery, 36(4):929--965, October 1989.]] Google ScholarDigital Library
- I. J. Cox, M. L. Miller, and J. A. Bloom. Digital Watermarking. Morgan Kaufmann Publishers, Inc., San Francisco, 2001.]] Google ScholarDigital Library
- J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. In International Conference on Databases Theory (ICDT), volume 1973 of Lecture Notes in Computer Science, pages 22--38. Springer, 2001.]] Google ScholarDigital Library
- H. Gaifman. On local and non-local properties. In Proceedings of the Herbrand Symposium, Logic Colloquium'1981, North Holland, 1982.]]Google ScholarCross Ref
- M. Grohe and T. Schwentick. Locality of order-invariant first-order formulas. ACM Transactions on Computational Logic (TOCL), 1(1):112--130, 2000.]] Google ScholarDigital Library
- M. Grohe and G. Turán. Learnability and definability in trees and similar structures. Lecture Notes in Computer Science, 2285:645--658, 2002.]] Google ScholarDigital Library
- S. Grumbach, L. Libkin, T. Milo, and L. Wong. Query language for bags: expressive power and complexity. SIGACT News, 27:30--37, 1996.]] Google ScholarDigital Library
- S. Katzenbeisser and F. A. P. Petitcolas, editors. Information hiding: techniques for steganography and digital watermarking. Computer security series. Artech house, 2000.]] Google ScholarDigital Library
- S. Khanna and F. Zane. Watermarking maps: hiding information in structured data. In Symposium on Discrete Algorithms (SODA), 2000.]] Google ScholarDigital Library
- P. Kolaitis and M. Thakur. Logical definability of NP optimization problems. Information and Computation, 115:321--353, 1994.]] Google ScholarDigital Library
- L. Libkin and J. Nurmonen. Counting and locality over finite structures: a survey. In Generalized Quantifiers and Computation, Springer LNCS 1754, pages 18--50, 1999.]] Google ScholarDigital Library
- L. Libkin and L. Wong. On the power of aggregation in relational query languages. In Database Programming Languages (DBPL'97), Springer LNCS 1369, pages 260--280, 1997.]] Google ScholarDigital Library
- L. Libkin and L. Wong. Query languages for bags and aggregate functions. Journal of Computer and System Sciences, 55(2):241--272, 1997.]] Google ScholarDigital Library
- T. Milo, D. Suciu, and V. Vianu. Typechecking for XML Transformers. In Symposium on Principles of Databases Systems (PODS), 2000.]] Google ScholarDigital Library
- F. Neven and T. Schwentick. Query automata on finite trees. Theoretical Computer Science, 275:633--674, 2002.]] Google ScholarDigital Library
- C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425--440, 1991.]]Google ScholarCross Ref
- G. Qu and M. Potkonjak. Hiding signatures in graph coloring solutions. In Information Hiding, pages 348--367, 1999.]] Google ScholarDigital Library
- G. Qu, J. L. Wong, and M. Potkonjak. Optimization-intensive watermarking techniques for decision problems. In DAC, pages 33--36, 1999.]] Google ScholarDigital Library
- R. Sion, M. Atallah, and S. Prabhakar. On watermarking semi-structures. Technical Report TR 2001--54, CERIAS, Nov 2001.]]Google Scholar
- L. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8(3), 1979.]]Google ScholarDigital Library
- L. G. Valiant. A theory of the learnable. In Symposium on Theory of Computing, pages 436--445, 1984.]] Google ScholarDigital Library
- G. Wolfe, J. L. Wong, and M. Potkonjak. Watermarking graph partitioning solutions. In DAC, pages 486--489, 2001.]] Google ScholarDigital Library
- M. Zimand. Weighted NP optimization problems: logical definability and approximation properties. SIAM Journal of Computing, 28(1):36--56, 1998.]] Google ScholarDigital Library
Index Terms
- Query-preserving watermarking of relational databases and XML documents
Recommendations
Query-preserving watermarking of relational databases and Xml documents
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 ...
Visible watermarking with reversibility of multimedia images for ownership declarations
Digital watermarking technology is primarily the joining of the rightful owner of the protected media. Once the media are suspected to be illegally used, an open algorithm can be used to extract the digital watermark for the purpose of showing the media'...
A watermarking-based image ownership and tampering authentication scheme
Nowadays, image authentication schemes are widely applied to ownership protection and tampering detection of digital images. In this paper, we propose an image ownership and tampering authentication scheme based on watermarking techniques, which is ...
Comments