Watermarking relational data based on adaptive mechanism

Author

Wang, Yuer ; Zhu, Zhongjie ; Liang, Feng ; Jiang, Gangyi

Author_Institution

Ningbo Key Lab. for DSP, Zhejiang Wanli Univ., Ningbo

fYear

2008

fDate

20-23 June 2008

Firstpage

131

Lastpage

134

Abstract

A novel watermarking algorithm is proposed for intellectual property rights (IPR) protection for relational data. An adaptive mechanism is adopted to choose an optimal embedding scheme for each datasheet according to its data characteristics based on predefined several fundamental schemes aiming at making distortion of the watermarked data to be smallest. The error-correcting coding technology and the majority voting principle are employed to improve the robustness of watermarking. Experimental results reveal that the watermarking can meet the invisibility and the blind detection requirements and the proposed algorithm has good resistance to conventional attacks such as subset deleting, adding, updating, and so on.

Keywords

cryptography; error correction codes; relational databases; watermarking; IPR protection; adaptive mechanism; cryptography; error-correction coding technology; intellectual property right; majority voting principle; relational data; watermarking; Automation; Circuits and systems; Data mining; Digital signal processing; Intellectual property; Protection; Relational databases; Robustness; Voting; Watermarking; Adaptive mechanism; IPR protection; Relational data; Robustness; Watermarking;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Automation, 2008. ICIA 2008. International Conference on

Conference_Location

Changsha

Print_ISBN

978-1-4244-2183-1

Electronic_ISBN

978-1-4244-2184-8

Type

conf

DOI

10.1109/ICINFA.2008.4607981

Filename

4607981