LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases

In 2002, Agrawal and Kiernan defined six basic requirements, including preventing illegal watermark embedding and authentication, reversibility, robustness, and others, which must be satisfied when a reversible watermark is designed for relational databases. To meet these requirements, in this paper...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Chia-Chen Lin, Thai-Son Nguyen, Chin-Chen Chang
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	blind lossless watermark relational database robustness categorical data Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/96b265617a9d418396c67a0e1572abd0
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:96b265617a9d418396c67a0e1572abd0
record_format	dspace
spelling	oai:doaj.org-article:96b265617a9d418396c67a0e1572abd02021-11-25T19:07:28ZLRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases10.3390/sym131121912073-8994https://doaj.org/article/96b265617a9d418396c67a0e1572abd02021-11-01T00:00:00Zhttps://www.mdpi.com/2073-8994/13/11/2191https://doaj.org/toc/2073-8994In 2002, Agrawal and Kiernan defined six basic requirements, including preventing illegal watermark embedding and authentication, reversibility, robustness, and others, which must be satisfied when a reversible watermark is designed for relational databases. To meet these requirements, in this paper, a lossless watermarking scheme for a categorical relational database called LRW-CRDB (lossless robust watermarking for categorical relational databases) is proposed. In our LRW-CRDB scheme, the database owner needs to generate two secret embedding keys, <i>K</i><sub>1</sub> and <i>K</i><sub>2</sub>, in advance. Then, two reference sets are generated based on two different secret embedding keys and a symmetry-based data hiding strategy, and then these are used for the watermark embedding phases. Experimental results confirmed that our LRW-CRDB scheme successfully detects 100% of hidden watermarks, even when more than 95% of the watermarked relational database has been deleted. In other words, the robustness of our proposed LRW-CRDB scheme outperforms other existing schemes under a variety of possible attacks, such as alteration, sorting, deletion, and mix-match attacks.Chia-Chen LinThai-Son NguyenChin-Chen ChangMDPI AGarticleblindlossless watermarkrelational databaserobustnesscategorical dataMathematicsQA1-939ENSymmetry, Vol 13, Iss 2191, p 2191 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	blind lossless watermark relational database robustness categorical data Mathematics QA1-939
spellingShingle	blind lossless watermark relational database robustness categorical data Mathematics QA1-939 Chia-Chen Lin Thai-Son Nguyen Chin-Chen Chang LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases
description	In 2002, Agrawal and Kiernan defined six basic requirements, including preventing illegal watermark embedding and authentication, reversibility, robustness, and others, which must be satisfied when a reversible watermark is designed for relational databases. To meet these requirements, in this paper, a lossless watermarking scheme for a categorical relational database called LRW-CRDB (lossless robust watermarking for categorical relational databases) is proposed. In our LRW-CRDB scheme, the database owner needs to generate two secret embedding keys, <i>K</i><sub>1</sub> and <i>K</i><sub>2</sub>, in advance. Then, two reference sets are generated based on two different secret embedding keys and a symmetry-based data hiding strategy, and then these are used for the watermark embedding phases. Experimental results confirmed that our LRW-CRDB scheme successfully detects 100% of hidden watermarks, even when more than 95% of the watermarked relational database has been deleted. In other words, the robustness of our proposed LRW-CRDB scheme outperforms other existing schemes under a variety of possible attacks, such as alteration, sorting, deletion, and mix-match attacks.
format	article
author	Chia-Chen Lin Thai-Son Nguyen Chin-Chen Chang
author_facet	Chia-Chen Lin Thai-Son Nguyen Chin-Chen Chang
author_sort	Chia-Chen Lin
title	LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases
title_short	LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases
title_full	LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases
title_fullStr	LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases
title_full_unstemmed	LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases
title_sort	lrw-crdb: lossless robust watermarking scheme for categorical relational databases
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/96b265617a9d418396c67a0e1572abd0
work_keys_str_mv	AT chiachenlin lrwcrdblosslessrobustwatermarkingschemeforcategoricalrelationaldatabases AT thaisonnguyen lrwcrdblosslessrobustwatermarkingschemeforcategoricalrelationaldatabases AT chinchenchang lrwcrdblosslessrobustwatermarkingschemeforcategoricalrelationaldatabases
_version_	1718410292315029504

LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases

Ejemplares similares