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

  • Authors:
  • Tian-Lei Hu;Gang Chen;Ke Chen;Jin-Xiang Dong

  • Affiliations:
  • College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China

  • Venue:
  • WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.