GARWM: Towards a generalized and adaptive watermark scheme for relational data

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Watermarking relational data is to protect the intellectual property of sensitive and valuable relational data that is outsourced for sale. Based on analysis of the characteristics of relational data and the corresponding watermarking techniques, the relational data watermarking problem is formalized, and a generalized and adaptive relational data watermarking framework (GARWM) is proposed. The GARWM framework exploits the properties of relational data in the semantics of watermarking, such as preservation of logical relationship in usability preserving attack, discrimination in significance of attributes, and local constraints/global metrics, to strengthen existing methods. The insertion/detection algorithms are presented to insert/detect watermarks into/from non-numeric attributes besides numeric attributes. We identify and classify potential threats to the watermark of relational data including simple attacks, detection-disabling attacks, and ambiguity attacks. We show that GARWM is resilient to these threats, and experiment results quantitatively demonstrate the robustness of our techniques. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hu, T. L., Chen, G., Chen, K., & Dong, J. X. (2005). GARWM: Towards a generalized and adaptive watermark scheme for relational data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3739 LNCS, pp. 380–391). https://doi.org/10.1007/11563952_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free