Query-preserving Watermarking of Relational Databases and XML Documents

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 191-201

  Gross Amblard, David ^a  

^a CEDRIC CNAM   (France)

Author keywords

VC dimension; Watermarking; Watermarking scheme

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; MATHEMATICAL MODELS; PARAMETER ESTIMATION; QUERY LANGUAGES; TREES (MATHEMATICS); WATERMARKING; XML;

DIGITAL DOCUMENTS; PARAMETRIC QUERIES;

RELATIONAL DATABASE SYSTEMS;

EID: 1142299757     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773172     Document Type: Conference Paper

References (24)

1. R. Agrawal and J. Kiernan. Watermarking Relational Databases. In International Conference on Very Large Databases (VLDB), 2002.
2. 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.
3. I. J. Cox, M. L. Miller, and J. A. Bloom. Digital Watermarking. Morgan Kaufmann Publishers, Inc., San Francisco, 2001.
4. 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.
5. H. Gaifman. On local and non-local properties. In Proceedings of the Herbrand Symposium, Logic Colloquium'1981, North Holland, 1982.
6. M. Grohe and T. Schwentick. Locality of order-invariant first-order formulas. ACM Transactions on Computational Logic (TOCL), 1(1):112-130, 2000.
7. M. Grohe and G. Turán. Learnability and definability in trees and similar structures. Lecture Notes in Computer Science, 2285:645-658, 2002.
8. S. Grumbach, L. Libkin, T. Milo, and L. Wong. Query language for bags: expressive power and complexity. SIGACT News, 27:30-37, 1996.
9. S. Katzenbeisser and F. A. P. Petitcolas, editors. Information hiding: techniques for steganography and digital watermarking. Computer security series. Artech house, 2000.
10. S. Khanna and F. Zane. Watermarking maps: hiding information in structured data. In Symposium on Discrete Algorithms (SODA), 2000.
11. P. Kolaitis and M. Thakur. Logical definability of NP optimization problems. Information and Computation, 115:321-353, 1994.
12. 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.
13. 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.
14. L. Libkin and L. Wong. Query languages for bags and aggregate functions. Journal of Computer and System Sciences, 55(2):241-272, 1997.
15. T. Milo, D. Suciu, and V. Vianu. Typechecking for XML Transformers. In Symposium on Principles of Databases Systems (PODS), 2000.
16. F. Neven and T. Schwentick. Query automata on finite trees. Theoretical Computer Science, 275:633-674, 2002.
17. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425-440, 1991.
18. G. Qu and M. Potkonjak. Hiding signatures in graph coloring solutions. In Information Hiding, pages 348-367, 1999.
19. G. Qu, J. L. Wong, and M. Potkonjak. Optimization-intensive watermarking techniques for decision problems. In DAC, pages 33-36, 1999.
20. R. Sion, M. Atallah, and S. Prabhakar. On watermarking semi-structures. Technical Report TR 2001-54, CERIAS, Nov 2001.
21. L. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8(3), 1979.
22. L. G. Valiant. A theory of the learnable. In Symposium on Theory of Computing, pages 436-445, 1984.
23. G. Wolfe, J. L. Wong, and M. Potkonjak. Watermarking graph partitioning solutions. In DAC, pages 486-489, 2001.
24. M. Zimand. Weighted NP optimization problems: logical definability and approximation properties. SIAM Journal of Computing, 28(1):36-56, 1998.