A Fragile Zero Watermarking Scheme to Detect and Characterize Malicious Modifications in Database Relations

The Scientific World JOURNAL ◽

10.1155/2013/796726 ◽

2013 ◽

Vol 2013 ◽

pp. 1-16 ◽

Cited By ~ 15

Author(s):

Aihab Khan ◽

Syed Afaq Husain

Keyword(s):

Data Quality ◽

Relational Database ◽

Relational Databases ◽

Original Data ◽

Experimental Results ◽

Zero Watermarking ◽

Watermarking Scheme ◽

Database Relation ◽

Data Usability ◽

Data Modifications

We put forward a fragile zero watermarking scheme to detect and characterize malicious modifications made to a database relation. Most of the existing watermarking schemes for relational databases introduce intentional errors or permanent distortions as marks into the database original content. These distortions inevitably degrade the data quality and data usability as the integrity of a relational database is violated. Moreover, these fragile schemes can detect malicious data modifications but do not characterize the tempering attack, that is, the nature of tempering. The proposed fragile scheme is based on zero watermarking approach to detect malicious modifications made to a database relation. In zero watermarking, the watermark is generated (constructed) from the contents of the original data rather than introduction of permanent distortions as marks into the data. As a result, the proposed scheme is distortion-free; thus, it also resolves the inherent conflict between security and imperceptibility. The proposed scheme also characterizes the malicious data modifications to quantify the nature of tempering attacks. Experimental results show that even minor malicious modifications made to a database relation can be detected and characterized successfully.

Download Full-text

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

Symmetry ◽

10.3390/sym13112191 ◽

2021 ◽

Vol 13 (11) ◽

pp. 2191

Author(s):

Chia-Chen Lin ◽

Thai-Son Nguyen ◽

Chin-Chen Chang

Keyword(s):

Data Hiding ◽

Relational Database ◽

Relational Databases ◽

Experimental Results ◽

Robust Watermarking ◽

Watermark Embedding ◽

Lossless Watermarking ◽

Watermarking Scheme ◽

Reversible Watermark

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, K1 and K2, 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.

Download Full-text

Distortion-Free Watermarking Approach for Relational Database Integrity Checking

Mathematical Problems in Engineering ◽

10.1155/2014/697165 ◽

2014 ◽

Vol 2014 ◽

pp. 1-10 ◽

Cited By ~ 9

Author(s):

Lancine Camara ◽

Junyi Li ◽

Renfa Li ◽

Wenyong Xie

Keyword(s):

Third Party ◽

Group Level ◽

Content Protection ◽

New Approach ◽

Matrix Groups ◽

Database Integrity ◽

Integrity Checking ◽

Zero Watermarking ◽

Database Relation ◽

Data Usability

Nowadays, internet is becoming a suitable way of accessing the databases. Such data are exposed to various types of attack with the aim to confuse the ownership proofing or the content protection. In this paper, we propose a new approach based on fragile zero watermarking for the authentication of numeric relational data. Contrary to some previous databases watermarking techniques which cause some distortions in the original database and may not preserve the data usability constraints, our approach simply seeks to generate the watermark from the original database. First, the adopted method partitions the database relation into independent square matrix groups. Then, group-based watermarks are securely generated and registered in a trusted third party. The integrity verification is performed by computing the determinant and the diagonal’s minor for each group. As a result, tampering can be localized up to attribute group level. Theoretical and experimental results demonstrate that the proposed technique is resilient against tuples insertion, tuples deletion, and attributes values modification attacks. Furthermore, comparison with recent related effort shows that our scheme performs better in detecting multifaceted attacks.

Download Full-text

Audio Retrieval Based on Chinese Keyword Search in Relational Databases

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.756-759.3236 ◽

2013 ◽

Vol 756-759 ◽

pp. 3236-3240

Author(s):

Bo Yan Zhu ◽

Guang Liu ◽

Liang Zhu

Keyword(s):

Relational Database ◽

Relational Databases ◽

Keyword Search ◽

Database System ◽

Experimental Results ◽

Chinese Characters ◽

Relational Database System ◽

Audio Retrieval ◽

Ranking Strategy ◽

Audio Files

In this paper, we propose a new method based on Chinese keyword search to select the WAV or MP3 files in audio post-production. First, we listen to each file and label it with Chinese characters, and then classify and store the files in a relational database system. Then, we use the techniques of Chinese keyword search to match query characters and the tuple characters quickly, and to compute similarities between the query and candidate tuples. For the characteristics of Chinese keyword search, we present a ranking strategy and an algorithm to refine the candidate tuples resulting from the first round matching, and finally get top-Nresults of audio files. The experimental results show that our method is efficient and effective.

Download Full-text

Speech Algorithm for Watermarking Relational Databases Based on Weighted

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.121-122.399 ◽

2010 ◽

Vol 121-122 ◽

pp. 399-404

Author(s):

Ye Hong Zhang ◽

Zhi Xian Gao ◽

Dong Xian Yu

Keyword(s):

Relational Database ◽

Speech Signal ◽

Relational Databases ◽

Experimental Results ◽

Relational Data ◽

It Support ◽

Novel Method

We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking. This paper creatively proposes a novel method for watermarking relational database, which uses speech signal as watermark embed into database according to the weight of attributes. Experimental results show that the proposed scheme is robust against various forms of attacks. Our approach is more intuitive, and it support easy watermark identification.

Download Full-text

A Blind Reversible Robust Watermarking Scheme for Relational Databases

The Scientific World JOURNAL ◽

10.1155/2013/717165 ◽

2013 ◽

Vol 2013 ◽

pp. 1-12 ◽

Cited By ~ 5

Author(s):

Chin-Chen Chang ◽

Thai-Son Nguyen ◽

Chia-Chen Lin

Keyword(s):

Relational Database ◽

Relational Databases ◽

Digital Data ◽

Data Embedding ◽

Robust Watermarking ◽

Extensive Analysis ◽

Proof Of Ownership ◽

Reversible Data Embedding ◽

Adjacent Pixel ◽

Watermarking Scheme

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.

Download Full-text

A Strong Robust Zero-Watermarking Scheme Based on Shearlets’ High Ability for Capturing Directional Features

Mathematical Problems in Engineering ◽

10.1155/2016/2643263 ◽

2016 ◽

Vol 2016 ◽

pp. 1-11 ◽

Cited By ~ 3

Author(s):

Jian Zhao ◽

Wensheng Xu ◽

Shunli Zhang ◽

Shuaishuai Fan ◽

Wanru Zhang

Keyword(s):

Wavelet Transform ◽

Digital Watermarking ◽

Experimental Results ◽

Discrete Wavelet ◽

High Ability ◽

Multiscale Representation ◽

Good Balance ◽

Zero Watermarking ◽

Watermarking Scheme ◽

The Given

Zero-watermarking is a blind digital watermarking method. It has reached the point where the robustness and the imperceptibility can arrive at a good balance. In this paper, a strong robust zero-watermarking scheme is proposed which employs multiresolution and multiscale representation characteristics of nonsubsampled shearlet transform to analyze the direction features of the given image. The effectiveness of the proposed scheme for dealing with many kinds of attack such as compression, noise addition, and scaling is demonstrated by the experimental results. When compared with other zero-watermarking schemes using counterpart transforms like discrete wavelet transform, the experimental results show that the proposed watermarking scheme can get better performance.

Download Full-text

Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

Applied Sciences ◽

10.3390/app9040642 ◽

2019 ◽

Vol 9 (4) ◽

pp. 642 ◽

Cited By ~ 3

Author(s):

Xu Xi ◽

Xinchang Zhang ◽

Weidong Liang ◽

Qinchuan Xin ◽

Pengcheng Zhang

Keyword(s):

Singular Value Decomposition ◽

Singular Value ◽

Two Dimensional ◽

Triangle Mesh ◽

Vector Map ◽

Vector Maps ◽

Feature Sequence ◽

Zero Watermarking ◽

Value Decomposition ◽

Watermarking Scheme

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.

Download Full-text