Query-preserving watermarking of relational databases and XML documents

ACM Transactions on Database Systems

Volumn 36, Issue 1, 2011, Pages

  Gross Amblard, David ^a,b  

^a INRIA SACLAY   (France)

^b UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

VC dimension; Watermarking

Indexed keywords

BOUNDED DEGREE; COMPUTATIONAL LEARNING THEORY; DIGITAL DOCUMENTS; NUMERICAL ATTRIBUTES; RELATIONAL DATABASE; SECOND ORDERS; TREE-LIKE STRUCTURES; VC-DIMENSION; WATERMARKING CAPACITY; WATERMARKING RELATIONAL DATABASE;

COMPUTATION THEORY; QUERY LANGUAGES; TREES (MATHEMATICS); XML;

WATERMARKING;

COMPUTATION; MATHEMATICS; TREES;

EID: 79953235167     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1929934.1929937     Document Type: Article

References (33)

1. AGRAWAL, R., HAAS, P. J., AND KIERNAN, J. 2003. Watermarking relational data: Framework, algorithms and analysis. VLDB J. 12, 2, 157-169. (Pubitemid 37017926)
2. BLUMER, A., EHRENFEUCHT, A., HAUSSLER, D., AND WARMUTH, M. K. 1989. Learnability and the Vapnik- Chervonenkis dimension. J. ACM 36, 4, 929-965.
3. CAPPELINI, V.,BARTOLINI, F., AND BARNI,M. 2001. Information theoretic aspects in digital watermarking. Signal Process. 81, 6, 1117-1119. (Pubitemid 32509286)
4. COX, I. J.,MILLER, M. L., AND BLOOM, J. A. 2001. Digital Watermarking. Morgan Kaufmann Publishers, Inc., San Francisco.
5. FLUM, J., FRICK, M., AND GROHE, M. 2002. Query evaluation via tree-decompositions. J. ACM 49, 716-752.
6. GAIFMAN, H. 1982. On local and non-local properties. In Proceedings of the Herbrand Symposium, Logic Colloquium 1981. North Holland.
7. GRÄDEL, E. AND GUREVICH, Y. 1998. Metafinite model theory. Inf. Comput. 140, 1, 26-81. (Pubitemid 128638660)
8. GROHE, M. AND SCHWENTICK, T. 2000. Locality of order-invariant first-order formulas. ACM Trans. Computat. Logic 1, 1, 112-130.
9. GROHE, M. AND TURÁN, G. 2004. Learnability and definability in trees and similar structures. Theory Comput. Syst. 37, 193-220. (Pubitemid 38259812)
10. GROSS-AMBLARD, D. 2003. Query-Preserving Watermarking of Relational Databases and XML Documents. In Proceedings of the Symposium on Principles of Databases Systems (PODS). 191-201.
11. GRUMBACH, S., LIBKIN, L., MILO, T., AND WONG, L. 1996. Query language for bags: Expressive power and complexity. SIGACT News 27, 30-37.
12. HELLA, L., LIBKIN, L., NURMONEN, J., AND WONG, L. 2001. Logics with aggregate operators. J. ACM 48, 4, 880-907.
13. KATZENBEISSER, S. AND PETITCOLAS, F. A. P., Eds. 2000. Information Hiding: Techniques for Steganography and Digital Watermarking. Computer Security Series. Artech House.
14. KHANNA, S. AND ZANE, F. 2000. Watermarking maps: Hiding information in structured data. In Proceedings of the Symposium on Discrete Algorithms (SODA). 596-605. (Pubitemid 30549308)
15. KOLAITIS, P. AND THAKUR, M. 1994. Logical definability of NP optimization problems. Inform. Computat. 115, 321-353.
16. LAFAYE, J.,GROSS-AMBLARD, D.,CONSTANTIN, C., AND GUERROUANI,M. 2008.Watermill: An optimized fingerprinting system for databases under constraints. IEEE Trans. Knowl. Data Engin. 20, 4, 532-546. (Pubitemid 351337422)
17. LI, Y., SWARUP, V., AND JAJODIA, S. 2005. Fingerprinting relational databases: Schemes and specialties. IEEE Trans. Dependable Sec. Comput. 2, 1, 34-45.
18. LIBKIN, L. AND WONG, L. 1997. Query languages for bags and aggregate functions. J. Comput. Syst. Sci. 55, 2, 241-272. (Pubitemid 127438558)
19. MILO, T., SUCIU, D., AND VIANU, V. 2003. Typechecking for XML transformers. J. Comput. Syst. Sci. 66, 1, 66-97.
20. NEVEN, F. AND SCHWENTICK, T. 2002. Query automata on finite trees. Theor. Comput. Sci. 275, 633-674.
21. PAPADIMITRIOU, C. H. AND YANNAKAKIS, M. 1991. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 3, 425-440.
22. QU, G. AND POTKONJAK, M. 1999. Hiding signatures in graph coloring solutions. In Proceedings of the 3rd Information Hiding Workshop. 348-367.
23. QU, G. AND POTKONJAK, M. 2003. Intellectual Property Protection in VLSI Design: Theory and Practice. Kluwer Publishing.
24. SHEHAB, M.,BERTINO, E., AND GHAFOOR, A. 2008.Watermarking relational databases using optimization-based techniques. IEEE Trans. Knowl. Data Engin. 20, 1, 116-129.
25. SION, R., ATALLAH, M., AND PRABHAKAR, S. 2004. Protecting rights over relational data using watermarking. IEEE Trans. Knowl. Data Engin. 16, 12, 1509-1525. (Pubitemid 40010925)
26. STOCKMEYER, L. AND MEYER, A. 1973. Word problems requiring exponential time: Preliminary report. In Proceedings of the Symposium on Theory of Computing (STOC). 1-9.
27. TARDOS, G. 2008. Optimal probabilistic fingerprint codes. J. ACM 55, 2.
28. VALIANT, L. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3.
29. VALIANT, L. G. 1984. A theory of the learnable. In Proceedings of the Symposium on Theory of Computing (STOC). 436-445.
30. WOLFE, G.,WONG, J. L., AND POTKONJAK, M. 2001. Watermarking graph partitioning solutions. In Proceedings of the Design Automation Conference (DAC). 486-489. (Pubitemid 32841002)
31. WONG, J. L., QU, G., AND POTKONJAK, M. 2004. Optimization-intensive watermarking techniques for decision problems. IEEE Trans. CAD Integr. Circu. Syst. 23, 1, 119-127.
32. ZENG, W., YU, H., AND LIN, C.-Y., Eds. 2006. Multimedia Security Technologies for Digital Rights Management. Academic Press.
33. ZIMAND, M. 1998. Weighted NP optimization problems: Logical definability and approximation properties. SIAM J. Comput. 28, 1, 36-56. (Pubitemid 128491790)