A Blind Reversible Robust Watermarking Scheme for Relational Databases

Protecting the ownership and controlling the copies of digital data have become very important issues in Internet-based applications. Reversible watermark technology allows the distortion-free recovery of relational databases after the embedded watermark data are detected or verified. In this paper,...

Full description

Bibliographic Details
Main Authors: Chin-Chen Chang, Thai-Son Nguyen, Chia-Chen Lin
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:The Scientific World Journal
Online Access:http://dx.doi.org/10.1155/2013/717165
id doaj-872b618fe9d646158776f27cfae524b9
record_format Article
spelling doaj-872b618fe9d646158776f27cfae524b92020-11-25T00:12:32ZengHindawi LimitedThe Scientific World Journal1537-744X2013-01-01201310.1155/2013/717165717165A Blind Reversible Robust Watermarking Scheme for Relational DatabasesChin-Chen Chang0Thai-Son Nguyen1Chia-Chen Lin2Department of Information Engineering and Computer Science, Feng Chia University, Taichung 40724, TaiwanDepartment of Information Engineering and Computer Science, Feng Chia University, Taichung 40724, TaiwanDepartment of Computer Science and Information Management, Providence University, No. 200 Chung-chi Road, Taichung 43301, TaiwanProtecting the ownership and controlling the copies of digital data have become very important issues in Internet-based applications. Reversible watermark technology allows the distortion-free recovery of relational databases after the embedded watermark data are detected or verified. In this paper, we propose a new, blind, reversible, robust watermarking scheme that can be used to provide proof of ownership for the owner of a relational database. In the proposed scheme, a reversible data-embedding algorithm, which is referred to as “histogram shifting of adjacent pixel difference” (APD), is used to obtain reversibility. The proposed scheme can detect successfully 100% of the embedded watermark data, even if as much as 80% of the watermarked relational database is altered. Our extensive analysis and experimental results show that the proposed scheme is robust against a variety of data attacks, for example, alteration attacks, deletion attacks, mix-match attacks, and sorting attacks.http://dx.doi.org/10.1155/2013/717165
collection DOAJ
language English
format Article
sources DOAJ
author Chin-Chen Chang
Thai-Son Nguyen
Chia-Chen Lin
spellingShingle Chin-Chen Chang
Thai-Son Nguyen
Chia-Chen Lin
A Blind Reversible Robust Watermarking Scheme for Relational Databases
The Scientific World Journal
author_facet Chin-Chen Chang
Thai-Son Nguyen
Chia-Chen Lin
author_sort Chin-Chen Chang
title A Blind Reversible Robust Watermarking Scheme for Relational Databases
title_short A Blind Reversible Robust Watermarking Scheme for Relational Databases
title_full A Blind Reversible Robust Watermarking Scheme for Relational Databases
title_fullStr A Blind Reversible Robust Watermarking Scheme for Relational Databases
title_full_unstemmed A Blind Reversible Robust Watermarking Scheme for Relational Databases
title_sort blind reversible robust watermarking scheme for relational databases
publisher Hindawi Limited
series The Scientific World Journal
issn 1537-744X
publishDate 2013-01-01
description Protecting the ownership and controlling the copies of digital data have become very important issues in Internet-based applications. Reversible watermark technology allows the distortion-free recovery of relational databases after the embedded watermark data are detected or verified. In this paper, we propose a new, blind, reversible, robust watermarking scheme that can be used to provide proof of ownership for the owner of a relational database. In the proposed scheme, a reversible data-embedding algorithm, which is referred to as “histogram shifting of adjacent pixel difference” (APD), is used to obtain reversibility. The proposed scheme can detect successfully 100% of the embedded watermark data, even if as much as 80% of the watermarked relational database is altered. Our extensive analysis and experimental results show that the proposed scheme is robust against a variety of data attacks, for example, alteration attacks, deletion attacks, mix-match attacks, and sorting attacks.
url http://dx.doi.org/10.1155/2013/717165
work_keys_str_mv AT chinchenchang ablindreversiblerobustwatermarkingschemeforrelationaldatabases
AT thaisonnguyen ablindreversiblerobustwatermarkingschemeforrelationaldatabases
AT chiachenlin ablindreversiblerobustwatermarkingschemeforrelationaldatabases
AT chinchenchang blindreversiblerobustwatermarkingschemeforrelationaldatabases
AT thaisonnguyen blindreversiblerobustwatermarkingschemeforrelationaldatabases
AT chiachenlin blindreversiblerobustwatermarkingschemeforrelationaldatabases
_version_ 1725398983068614656