Robust and Blind Watermarking of Relational Database Systems
A. Al-Haj & A. Odeh
Journal of Computer Science, Volume 4, Issue 12, pp. 1024–1029 · doi.org/10.3844/jcssp.2008.1024.1029
Abstract
Problem statement: Digital multimedia watermarking technology was suggested in the last decade to embed copyright information in digital objects such images, audio and video. However, the increasing use of relational database systems in many real-life applications created an ever increasing need for watermarking database systems. As a result, watermarking relational database systems is now merging as a research area that deals with the legal issue of copyright protection of database systems. Approach: In this study, we proposed an efficient database watermarking algorithm based on inserting binary image watermarks in non-numeric mutli-word attributes of selected database tuples. Results: The algorithm is robust as it resists attempts to remove or degrade the embedded watermark and it is blind as it does not require the original database in order to extract the embedded watermark. Conclusion: Experimental results demonstrated blindness and the robustness of the algorithm against common database attacks.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2008 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Al-Haj, A. & Odeh, A. (2008). Robust and Blind Watermarking of Relational Database Systems. Journal of Computer Science, 4(12), 1024–1029. https://doi.org/10.3844/jcssp.2008.1024.1029
- Licence
- © Science Publications
- Issue
- Volume 4, Issue 12
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
