1. A New Robust and Reversible Watermarking Technique Based on Erasure Code
- Author
-
Shuqiang Yang, Zoe Lin Jiang, Xuan Wang, Luo Hengyu, Yiqun Chen, and Chai Heyan
- Subjects
Computer science ,Relational database ,Data_MISCELLANEOUS ,05 social sciences ,ComputingMilieux_LEGALASPECTSOFCOMPUTING ,Watermark ,02 engineering and technology ,Data structure ,Computer security ,computer.software_genre ,Data sharing ,Robustness (computer science) ,020204 information systems ,0502 economics and business ,0202 electrical engineering, electronic engineering, information engineering ,Erasure code ,Cluster analysis ,Digital watermarking ,computer ,050203 business & management - Abstract
With the growth of Information and Communication Technology, data sharing plays a pivotal role in all parts of the Internet. A major issue that needs to be tackled urgently is to protect the ownership of data during the sharing process. Digital watermarking technology is a major solution to ownership protection. Many reversible watermarking approaches are proposed to achieve the function of ownership protection, but most methods can only resist malicious attacks to a certain extent and can not regenerate the complete watermarks in case part of watermarks are destroyed. In this paper, a robust and reversible watermarking technique (RRWEC) applied in relational database has been proposed, which utilizes the Erasure Codes Technique and watermarking in groups. The watermarks embedded into data come from meaningful characters of identification information of a database owner. The grouping method based on clustering, without dependent primary keys, is utilized to group the data, which can resist attacks on the data structure. The erasure code technique is devised to regenerate the complete watermarking information when some sub-watermarks embedded into data are maliciously modified or removed. The results of experiments verify the effectiveness and robustness of RRWEC against malicious attacks, such as data structure attack, subset addition attack, subset alteration and deletion attack, and show that when half of the watermarks are destroyed, the watermark regeneration algorithm can still recover the complete watermarking information.
- Published
- 2020