A Multiple-Bits Watermark for Relational Data

At the heart of the information economy, commercially and publicly useful databases must be sufficiently protected from pirated copying. Complementary to the Database Protection Act, database watermarking techniques are designed to thwart pirated copying by embedding ownerspecific information into databases so that the ownership of pirated copies of protected databases can be claimed if the embedded information is detected. This article presents a robust watermarking scheme for embedding a multiple-bits watermark to numerical attributes in database relations. The scheme is robust in the sense that it provides an upper bound for the probability that a valid watermark is detected from unmarked data, or a fictitious secret key is discovered from pirated data. This upper bound is independent of the size of the data. The scheme is extended to database relations without primary-key attributes to thwart attribute-related attacks. The scheme is also extended to multiple watermarks for defending additive attacks and for proving joint ownership.

Download Full-text

A Multiple-Bits Watermark for Relational Data

Advances in Database Research - Principle Advancements in Database Management Technologies ◽

10.4018/978-1-60566-904-5.ch001 ◽

2011 ◽

pp. 1-22

Author(s):

Yingjiu Li ◽

Huiping Guo ◽

Shuhong Wang

Keyword(s):

Upper Bound ◽

Specific Information ◽

Secret Key ◽

Information Economy ◽

Numerical Attributes ◽

Primary Key ◽

Multiple Watermarks ◽

Joint Ownership ◽

Database Protection ◽

Watermarking Scheme

At the heart of the information economy, commercially and publicly useful databases must be sufficiently protected from pirated copying. Complementary to the Database Protection Act, database watermarking techniques are designed to thwart pirated copying by embedding owner-specific information into databases so that the ownership of pirated copies of protected databases can be claimed if the embedded information is detected. This article presents a robust watermarking scheme for embedding a multiplebits watermark to numerical attributes in database relations. The scheme is robust in the sense that it provides an upper bound for the probability that a valid watermark is detected from unmarked data, or a fictitious secret key is discovered from pirated data. This upper bound is independent of the size of the data. The scheme is extended to database relations without primary-key attributes to thwart attributerelated attacks. The scheme is also extended to multiple watermarks for defending additive attacks and for proving joint ownership.

Download Full-text

A Robust Watermarking Scheme Based on Maximum Wavelet Coefficient Modification and Optimal Threshold Technique

Journal of Electrical and Computer Engineering ◽

10.1155/2015/370615 ◽

2015 ◽

Vol 2015 ◽

pp. 1-8 ◽

Cited By ~ 2

Author(s):

Chunlei Li ◽

Xiaowei Song ◽

Zhoufeng Liu ◽

Aihua Zhang ◽

Ruimin Yang

Keyword(s):

Wavelet Coefficient ◽

Median Filter ◽

Threshold Value ◽

Extraction Process ◽

Optimal Threshold ◽

Secret Key ◽

Robust Watermarking ◽

Iterative Computation ◽

Watermarking Scheme ◽

Threshold Technique

Digital watermarking has received extensive attention as a new method for copyright protection. This paper proposes a robust watermarking algorithm based on maximum wavelet coefficient modification and optimal threshold technique. The medium wavelet coefficients are randomly permutated according to a secret key and divided into subgroups. We modify the maximum wavelet in each subgroup according to the embedded watermark bits, which can effectively resist attacks. During the extraction process, an optimal threshold value calculated by iterative computation is used to extract the watermark from the watermarked image under different attacks, without using the original image or watermark. Numerous experiments are conducted to evaluate the watermarking performance. Experimental results demonstrate the superiority of our scheme on robustness against content-preserving operations and incidental distortions such as JPEG compression, Gaussian noise, median filter, resizing, cropping, and sharpening.

Download Full-text

Robust Watermarking Scheme for GIS Vector Maps

Ibn AL- Haitham Journal For Pure and Applied Science ◽

10.30526/31.1.1835 ◽

2018 ◽

Vol 31 (1) ◽

pp. 277 ◽

Cited By ~ 1

Author(s):

Methaq Talib Gaata

Keyword(s):

Main Idea ◽

Geospatial Data ◽

Robust Watermarking ◽

Digital Map ◽

Statistical Measures ◽

Data Authentication ◽

Two Factors ◽

Illegal Copying ◽

Value Decomposition ◽

Watermarking Scheme

With the fast progress of information technology and the computer networks, it becomes very easy to reproduce and share the geospatial data due to its digital styles. Therefore, the usage of geospatial data suffers from various problems such as data authentication, ownership proffering, and illegal copying ,etc. These problems can represent the big challenge to future uses of the geospatial data. This paper introduces a new watermarking scheme to ensure the copyright protection of the digital vector map. The main idea of proposed scheme is based on transforming the digital map to frequently domain using the Singular Value Decomposition (SVD) in order to determine suitable areas to insert the watermark data. The digital map is separated into the isolated parts.Watermark data are embedded within the nominated magnitudes in each part when satisfied the definite criteria. The efficiency of proposed watermarking scheme is assessed within statistical measures based on two factors which are fidelity and robustness. Experimental results demonstrate the proposed watermarking scheme representing ideal trade off for disagreement issue between distortion amount and robustness. Also, the proposed scheme shows robust resistance for many kinds of attacks.

Download Full-text

Geometrically Invariant NSCT–GPCET-Based Image Watermarking with Accurate Moment Calculation

Journal of Circuits System and Computers ◽

10.1142/s0218126621502844 ◽

2021 ◽

pp. 2150284

Author(s):

Wenbing Wang ◽

Shengli Liu ◽

Liu Feng

Keyword(s):

Calculation Method ◽

Image Watermarking ◽

Robust Watermarking ◽

Exponential Transform ◽

Computational Simplicity ◽

Polar Complex Exponential Transform ◽

Watermarking Scheme ◽

Complex Exponential ◽

Grid Division ◽

Geometrical Attacks

Generic polar complex exponential transform (GPCET), as continuous orthogonal moment, has the advantages of computational simplicity, numerical stability, and resistance to geometric transforms, which make it suitable for watermarking. However, errors in kernel function discretization can degrade these advantages. To maximize the GPCET utilization in robust watermarking, this paper proposes a secondary grid-division (SGD)-based moment calculation method that divides each grid corresponding to one pixel into nonoverlapping subgrids and increases the number of sampling points. Using the accurate moment calculation method, a nonsubsampled contourlet transform (NSCT)–GPCET-based watermarking scheme with resistance to image processing and geometrical attacks is proposed. In this scheme, the accurate moment calculation can reduce the numerical error and geometrical error of the traditional methods, which is verified by an image reconstruction comparison. Additionally, NSCT and accurate GPCET are utilized to achieve watermark stability. Subsequent experiments test the proposed watermarking scheme for its invisibility and robustness, and verify that the robustness of the proposed scheme outperforms that of other schemes when its level of invisibility is significantly higher.

Download Full-text