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

Symmetry ◽  
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.

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

2013 ◽  
Vol 2013 ◽  
pp. 1-16 ◽  
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.

scholarly journals A Blind Reversible Robust Watermarking Scheme for Relational Databases

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
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.

A Reversible Watermarking Algorithm Resistant to Image Geometric Transformation

2019 ◽  
Vol 11 (1) ◽  
pp. 100-113
Author(s):  
Jian Li ◽  
Jinwei Wang ◽  
Shuang Yu ◽  
Xiangyang Luo
Keyword(s):  
High Performance ◽  
Side Information ◽  
Jpeg Compression ◽  
Reversible Watermarking ◽  
Experimental Results ◽  
Geometric Transformation ◽  
Original Image ◽  
Robust Watermark ◽  
Watermark Embedding ◽  
Watermarking Scheme

This article proposes a novel robust reversible watermarking algorithm. The proposed watermarking scheme is reversible because the original image can be recovered after extracting watermarks from the watermarked image, as long as it is not processed by an attacker. The scheme is robust because watermarks can still be extracted from watermarked images, even if it is undergone some malicious or normal operations like rotation and JPEG compression. It first selects two circles, which are centred at the centroid and the centre of image. Then, statistic quantities of these two circles are employed for robust watermark embedding by altering the pixels' value. The side information generated by above embedding process will be embedded as fragile watermarks at another stage to ensure the recovery of original image. Experimental results verify the high performance of the proposed algorithm in resisting various attacks, including JPEG compression and geometric transformation.

Audio Retrieval Based on Chinese Keyword Search in Relational Databases

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.

Speech Algorithm for Watermarking Relational Databases Based on Weighted

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.

scholarly journals Screen-Shooting Resilient Watermarking Scheme via Learned Invariant Keypoints and QT

Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6554
Author(s):  
Li Li ◽  
Rui Bai ◽  
Shanqing Zhang ◽  
Chin-Chen Chang ◽  
Mengtao Shi
Keyword(s):  
Neural Networks ◽  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Tensor Decomposition ◽  
Experimental Results ◽  
Robust Watermark ◽  
Watermark Embedding ◽  
Extraction Stage ◽  
Watermarking Scheme ◽  
Watermark Algorithm

This paper proposes a screen-shooting resilient watermarking scheme via learned invariant keypoints and QT; that is, if the watermarked image is displayed on the screen and captured by a camera, the watermark can be still extracted from the photo. A screen-shooting resilient watermarking algorithm should meet the following two basic requirements: robust keypoints and a robust watermark algorithm. In our case, we embedded watermarks by combining the feature region filtering model to SuperPoint (FRFS) neural networks, quaternion discrete Fourier transform (QDFT), and tensor decomposition (TD). First we applied FRFS to locate the embedding feature regions which are decided by the keypoints that survive screen-shooting. Second, we structured watermark embedding regions centered at keypoints. Third, the watermarks were embedded by the QDFT and TD (QT) algorithm, which is robust for capturing process attacks. In a partial shooting scenario, the watermark is repeatedly embedded into different regions in an image to enhance robustness. Finally, we extracted the watermarks from at least one region at the extraction stage. The experimental results showed that the proposed scheme is very robust for camera shooting (including partial shooting) different shooting scenarios, and special attacks. Moreover, the efficient mechanism of screen-shooting resilient watermarking could have propietary protection and leak tracing applications.

A Blind Image Watermarking Scheme Utilizing BTC Bitplanes

2011 ◽  
Vol 3 (4) ◽  
pp. 42-53 ◽  
Author(s):  
Chun-Ning Yang ◽  
Zhe-Ming Lu
Keyword(s):  
Image Watermarking ◽  
Image Authentication ◽  
Extraction Process ◽  
Experimental Results ◽  
Original Image ◽  
Image Block ◽  
Watermark Embedding ◽  
Extraction Processes ◽  
Watermarking Scheme ◽  
Blind Image

This paper presents a novel image watermarking scheme utilizing Block Truncation Coding (BTC). This scheme uses BTC to guide the watermark embedding and extraction processes. During the embedding process, the original cover image is first partitioned into non-overlapping 4×4 blocks. Then, BTC is performed on each block to obtain its BTC bitplane, and the number of ‘1’s in the bitplane is counted. If the watermark bit to be embedded is ‘1’ and the number of ‘1’s is odd, or the watermark bit to be embedded is ‘0’ and the number of ‘1’s is even, then no change is made. Otherwise, by changing at most three pixels in the original image block, the number of ‘1’s (or ‘0’s) in the renewed bitplane are forced to be odd for the watermark bit ‘1’ or to be even for the watermark bit ‘0’. During the extraction process, BTC is first performed on each block to obtain its bitplane. If the number of ‘1’s in the bitplane is odd, then the embedded watermark bit is ‘1’. Otherwise, the embedded watermark bit is ‘0’. The experimental results show that the proposed watermarking method is semi-fragile except for the changes in brightness and contrast; therefore, the proposed method can be used for image authentication.

A Watermarking Scheme Based on NSCT Using Computer-Generated Hologram

2012 ◽  
Vol 263-266 ◽  
pp. 3100-3103
Author(s):  
Xiao Yuan Yang ◽  
Hai Bin Yang ◽  
Peng Luo
Keyword(s):  
Low Frequency ◽  
Jpeg Compression ◽  
Experimental Results ◽  
Contourlet Transform ◽  
Transform Domain ◽  
Robust Watermarking ◽  
Obvious Advantage ◽  
Digital Holograms ◽  
Computer Generated Holograms ◽  
Watermarking Scheme

A robust watermarking scheme that used computer-generated holograms as the watermark is in NSCT (NonSampled Contourlet Transform) domain was proposed. To maintain imperceptibility and robustness, a repeated embedding algorithm is adopted to embed the mark hologram into the low-frequency subband of the NSCT host image. Compared with other watermark schemes using digital holograms, the proposed algorithm has the obvious advantage in robustness The experimental results demonstrated that the proposed method had good robustness to resist common attacks such as, rotation, scaling, translation, image flipping, combined attacks, filtering, occlusion, cropping, and JPEG compression.

scholarly journals Adaptive Watermarking Scheme Using Biased Shift of Quantization Index

2010 ◽  
Vol 2010 ◽  
pp. 1-6 ◽  
Author(s):  
Young-Ho Seo ◽  
Hyun-Jun Choi ◽  
Ji-Sang Yoo ◽  
Dong-Wook Kim
Keyword(s):  
Data Compression ◽  
Experimental Results ◽  
Linear Feedback ◽  
Blind Watermarking ◽  
Compression Process ◽  
Adaptive Watermarking ◽  
Watermark Embedding ◽  
Additional Process ◽  
Feedback Shift Register ◽  
Watermarking Scheme

We propose a watermark embedding and extracting method for blind watermarking. It uses the characteristics of a scalar quantizer to comply with the recommendation in JPEG, MPEG series, or JPEG2000. Our method performs embedding of a watermark bit by shifting the corresponding frequency transform coefficient (the watermark position) to a quantization index according to the value of the watermark bit, which prevents from losing the watermark information during the data compression process. The watermark can be embedded simultaneously to the quantization process without an additional process for watermarking, which means it can be performed at the same speed to the compression process. In the embedding process, a Linear Feedback Shift Register (LFSR) is used to hide the watermark informations and the watermark positions. The experimental results showed that the proposed method satisfies enough robustness and imperceptibility that are the major requirements for watermarking.

VQ-BASED GRAY WATERMARK EMBEDDING SCHEME WITH GENETIC INDEX ASSIGNMENT

2004 ◽  
Vol 04 (02) ◽  
pp. 165-181 ◽  
Author(s):  
FENG-HSING WANG ◽  
LAKHMI C. JAIN ◽  
JENG-SHYANG PAN
Keyword(s):  
Digital Watermarking ◽  
Experimental Results ◽  
Cover Image ◽  
Vector Quantisation ◽  
Watermark Embedding ◽  
Index Assignment ◽  
Watermarking Scheme ◽  
Genetic Index

A digital watermarking scheme based on vector quantisation (VQ) for gray watermark is proposed. It begins with the procedure of encoding the gray watermark, and embeds the encoded indices into the cover image in VQ domain then. To improve the performance of the watermarking scheme, a genetic index assignment (GIA) procedure, which modifies the signal of the watermark to suit the signal of the cover image, is proposed. The proposed gray watermark embedding scheme is easy to implement, requires no original cover image to be presented during extraction, expands the size of the used watermark, and provides better watermarked results. Experimental results will show the novelty and effectiveness of it.

Sign in / Sign up

Export Citation Format

Share Document