Article

Query-preserving watermarking of relational databases and XML documents

Author:

David Gross-AmblardAuthors Info & Claims

PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 191 - 201

https://doi.org/10.1145/773153.773172

Published: 09 June 2003 Publication History

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.

References

[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.]]

Digital Library

[3]

I. J. Cox, M. L. Miller, and J. A. Bloom. Digital Watermarking. Morgan Kaufmann Publishers, Inc., San Francisco, 2001.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[7]

M. Grohe and G. Turán. Learnability and definability in trees and similar structures. Lecture Notes in Computer Science, 2285:645--658, 2002.]]

Digital Library

[8]

S. Grumbach, L. Libkin, T. Milo, and L. Wong. Query language for bags: expressive power and complexity. SIGACT News, 27:30--37, 1996.]]

Digital Library

[9]

S. Katzenbeisser and F. A. P. Petitcolas, editors. Information hiding: techniques for steganography and digital watermarking. Computer security series. Artech house, 2000.]]

Digital Library

[10]

S. Khanna and F. Zane. Watermarking maps: hiding information in structured data. In Symposium on Discrete Algorithms (SODA), 2000.]]

Digital Library

[11]

P. Kolaitis and M. Thakur. Logical definability of NP optimization problems. Information and Computation, 115:321--353, 1994.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[14]

L. Libkin and L. Wong. Query languages for bags and aggregate functions. Journal of Computer and System Sciences, 55(2):241--272, 1997.]]

Digital Library

[15]

T. Milo, D. Suciu, and V. Vianu. Typechecking for XML Transformers. In Symposium on Principles of Databases Systems (PODS), 2000.]]

Digital Library

[16]

F. Neven and T. Schwentick. Query automata on finite trees. Theoretical Computer Science, 275:633--674, 2002.]]

Digital Library

[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.]]

Digital Library

[19]

G. Qu, J. L. Wong, and M. Potkonjak. Optimization-intensive watermarking techniques for decision problems. In DAC, pages 33--36, 1999.]]

Digital Library

[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.]]

Digital Library

[22]

L. G. Valiant. A theory of the learnable. In Symposium on Theory of Computing, pages 436--445, 1984.]]

Digital Library

[23]

G. Wolfe, J. L. Wong, and M. Potkonjak. Watermarking graph partitioning solutions. In DAC, pages 486--489, 2001.]]

Digital Library

[24]

M. Zimand. Weighted NP optimization problems: logical definability and approximation properties. SIAM Journal of Computing, 28(1):36--56, 1998.]]

Digital Library

Cited By

Yu YMa ZZhang JFang HZhang WYu N(2024)A statistical characteristics preserving watermarking scheme for time series databasesJUSTC10.52396/JUSTC-2023-009154:4(0401)Online publication date: 2024
https://doi.org/10.52396/JUSTC-2023-0091
Olliaro MPérez Gort MCortesi A(2022)Empirical analysis of the impact of queries on watermarked relational databasesExpert Systems with Applications10.1016/j.eswa.2022.117491204(117491)Online publication date: Oct-2022
https://doi.org/10.1016/j.eswa.2022.117491
Rizzo SBertini FMontesi D(2019)Fine-grain watermarking for intellectual property protectionEURASIP Journal on Information Security10.1186/s13635-019-0094-22019:1Online publication date: 12-Jul-2019
https://doi.org/10.1186/s13635-019-0094-2
Show More Cited By

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

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2003

291 pages

ISBN:1581136706

DOI:10.1145/773153

Conference Chair:
Frank Neven
Limburgs Universitair Centrum
,
General Chair:
Catriel Beeri
Hebrew University of Jerusalem
,
Program Chair:
Tova Milo
Tel Aviv University & INRIA

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGMOD/PODS03

Sponsor:

SIGMOD/PODS03: International Conference on Management of Data and Symposium on Principles Database and Systems

June 9 - 11, 2003

California, San Diego

Acceptance Rates

PODS '03 Paper Acceptance Rate 27 of 136 submissions, 20%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
1,054
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yu YMa ZZhang JFang HZhang WYu N(2024)A statistical characteristics preserving watermarking scheme for time series databasesJUSTC10.52396/JUSTC-2023-009154:4(0401)Online publication date: 2024
https://doi.org/10.52396/JUSTC-2023-0091
Olliaro MPérez Gort MCortesi A(2022)Empirical analysis of the impact of queries on watermarked relational databasesExpert Systems with Applications10.1016/j.eswa.2022.117491204(117491)Online publication date: Oct-2022
https://doi.org/10.1016/j.eswa.2022.117491
Rizzo SBertini FMontesi D(2019)Fine-grain watermarking for intellectual property protectionEURASIP Journal on Information Security10.1186/s13635-019-0094-22019:1Online publication date: 12-Jul-2019
https://doi.org/10.1186/s13635-019-0094-2
Liu YGuo MZhang JZhu YXie XAmsaleg LHuet BLarson MGravier GHung HNgo CTsang Ooi W(2019)A Novel Two-stage Separable Deep Learning Framework for Practical Blind WatermarkingProceedings of the 27th ACM International Conference on Multimedia10.1145/3343031.3351025(1509-1517)Online publication date: 15-Oct-2019
https://dl.acm.org/doi/10.1145/3343031.3351025
Martinez SGerard SCabot J(2018)On Watermarking for Collaborative Model-Driven EngineeringIEEE Access10.1109/ACCESS.2018.28410206(29715-29728)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2841020
Sion R(2018)Digital Rights ManagementEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_130(1088-1093)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_130
Contreras JCoatrieux G(2017)Protection of Relational Databases by Means of Watermarking: Recent Advances and ChallengesAdvances in Security in Computing and Communications10.5772/intechopen.68412Online publication date: 19-Jul-2017
https://doi.org/10.5772/intechopen.68412
Rizzo SBertini FMontesi DDesai BToyama MBernardino J(2016)Content-preserving Text Watermarking through Unicode Homoglyph SubstitutionProceedings of the 20th International Database Engineering & Applications Symposium10.1145/2938503.2938510(97-104)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2938503.2938510
Sion R(2016)Digital Rights ManagementEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_130-2(1-6)Online publication date: 25-Oct-2016
https://doi.org/10.1007/978-1-4899-7993-3_130-2
Kieseberg PSchrittwieser SMulazzani MEchizen IWeippl E(2014)An algorithm for collusion-resistant anonymization and fingerprinting of sensitive microdataElectronic Markets10.1007/s12525-014-0154-x24:2(113-124)Online publication date: 29-Apr-2014
https://doi.org/10.1007/s12525-014-0154-x
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents