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.

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 Content Characteristics Based Robust Watermarking for Relational Database: A New Approach to Database Security

2018 ◽  
Vol 7 (1.9) ◽  
pp. 302
Author(s):  
Manoj Kumar ◽  
O P. Verma
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Image Watermarking ◽  
Real Life ◽  
Database Security ◽  
Vital Role ◽  
Digital Data ◽  
Secret Key ◽  
Areas Of Interest ◽  
Audio Video

Digital data such as text, relational database, audio, video and software are intellectual property of creators/ writers/owners. The database services have become easily available and economical since the booming of internet. However, their outsourcing through the internet accompanies multiple threats like copying, modifying as well as unauthorized distribution. Relational Database has a wide-spread use in many real-life applications, hence, it is essential to maintain integrity and provide copyright protection. To counter the threats, watermarking techniques have been playing a vital role since the last decade. As a security measure, Relational Database Watermarking is becoming more popular and strengthened day-by-day. This is also one of the upcoming areas of interest among researchers of the Database Security. A technique earlier used for Image Watermarking is applied to watermark Relational Databases. In Image Watermarking technique, a pixel or a pair of pixels must satisfy certain characteristics. Usually, database watermarking techniques concentrate on hiding a watermark in database. Extraction and matching of hidden watermark with original watermark confirms ownership of database. This paper demonstrates the use of image watermarking technique for relational databases. Here we align some properties of attributes of database by changing some bit(s) in attribute value. Using secret key, we have ensured that values of two attributes of a tuples satisfy some bit-similarity property and to do so, we slightly alter values of attributes. Detection of such characteristic in a database using secret key can be done easily to verify the presence of a watermark.  

scholarly journals A Robust Watermarking Scheme for Online Multimedia Copyright Protection Using New Chaotic Map

2018 ◽  
Vol 2018 ◽  
pp. 1-20 ◽  
Author(s):  
Amir Anees ◽  
Iqtadar Hussain ◽  
Abdulmohsen Algarni ◽  
Muhammad Aslam
Keyword(s):  
Digital Media ◽  
Secure Communication ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Logistic Map ◽  
Digital Data ◽  
Robust Watermarking ◽  
Unified Framework ◽  
Watermarking Scheme ◽  
Randomness Tests

The protection of copyrights of digital media uploaded to the Internet is a growing problem. In this paper, first, we present a unified framework for embedding and detecting watermark in digital data. Second, a new robust watermarking scheme is proposed considering this concern. The proposed work incorporates three chaotic maps which specify the location for embedding the watermark. Third, a new chaotic map, the Extended Logistic map, is proposed in this work. The proposed map has a bigger range than logistic and cubic maps. It has shown good results in a bifurcation, sensitivity to initial conditions, and randomness tests. Furthermore, with the detailed analysis of initial parameters, it is justified that Extended Logistic map can be used in secure communication, particularly watermarking. Fourth, to check the robustness of proposed watermarking scheme, we have done a series of analyses and standard attacks. The results confirm that the proposed watermarking scheme is robust against visual and statistical analysis and can resist the standard attacks.

scholarly journals Content characteristics based robust watermarking for relational database: a new approach to database security

2018 ◽  
Vol 7 (1.9) ◽  
pp. 234
Author(s):  
Manoj Kumar ◽  
O. P. Verma
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Image Watermarking ◽  
Real Life ◽  
Database Security ◽  
Vital Role ◽  
Digital Data ◽  
Secret Key ◽  
Areas Of Interest ◽  
Audio Video

Digital data such as text, relational database, audio, video and software are intellectual property of creators/ writers/owners. The database services have become easily available and economical since the booming of internet. However, their outsourcing through the internet accompanies multiple threats like copying, modifying as well as unauthorized distribution. Relational Database has a wide-spread use in many real-life applications, hence, it is essential to maintain integrity and provide copyright protection. To counter the threats, watermarking techniques have been playing a vital role since the last decade. As a security measure, Relational Database Watermarking is becoming more popular and strengthened day-by-day. This is also one of the upcoming areas of interest among researchers of the Database Security. A technique earlier used for Image Watermarking is applied to watermark Relational Databases. In Image Watermarking technique, a pixel or a pair of pixels must satisfy certain characteristics. Usually, database watermarking techniques concentrate on hiding a watermark in database. Extraction and matching of hidden watermark with original watermark confirms ownership of database. This paper demonstrates the use of image watermarking technique for relational databases. Here we align some properties of attributes of database by changing some bit(s) in attribute value. Using secret key, we have ensured that values of two attributes of a tuples satisfy some bit-similarity property and to do so, we slightly alter values of attributes. Detection of such characteristic in a database using secret key can be done easily to verify the presence of a watermark.

scholarly journals A Robust Watermarking Technique for Copyright Protection for Relational Databases

2019 ◽  
Vol 8 (3) ◽  
pp. 4040-4046
Keyword(s):  
Copyright Protection ◽  
Relational Databases ◽  
The Internet ◽  
Robust Watermarking ◽  
Sensitive Data ◽  
Database Applications ◽  
Security Issues ◽  
Illegal Copying ◽  
Watermarking Scheme ◽  
Digital Assets

Internet based digitization has been of rapid increase in the usage of database applications at an enormous rate in recent times. It is very difficult to secure the ownership of digital assets because all the data on the internet are available everywhere almost free of cost and anybody can access such data and claim their ownership. In current digital scenario not only images, videos, and audio are in digital form. Databases are also digitized in different models and used as a service in database applications, including areas such as finance, multimedia, personnel, etc. A huge amount of confidential and sensitive data which are available publically facing a variety of threats like illegal copying, illegal redistribution, tampering, forgery and authentication. Authenticity, integrity, confidentiality and copyright protection are most important security issues to be addressed with most importance. Copyright management is a serious issue in database applications because it is much easier for others to download and manipulate copyrighted databases from the Internet and later re-use without any control. In this paper we proposed a robust watermarking scheme for copyright protection for relational databases, which protects the copy right information of the database even if the attacker tampers the data by changing the attribute values or reordering the tuples of the database. The proposed watermarking technique is robust since the watermark will not be lost even though the attacker tampers the data. The experiments show that the new method is efficient as well as effective for maintaining copy right information there by ensuring right protection to relational databases

Robust Watermarking Scheme for GIS Vector Maps

2018 ◽  
Vol 31 (1) ◽  
pp. 277 ◽  
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.

Using digital data collection tools to improve overall cost-efficiency and provide timely analysis for decision making during invasive species eradication campaigns

2014 ◽  
Vol 41 (6) ◽  
pp. 499 ◽  
Author(s):  
David J. Will ◽  
Karl J. Campbell ◽  
Nick D. Holmes
Keyword(s):  
Decision Making ◽  
Data Collection ◽  
Cost Efficiency ◽  
Relational Databases ◽  
Cost Effective ◽  
Digital Data ◽  
Capital Costs ◽  
Project Costs ◽  
Time Required ◽  
Data Collection Effort

Context Worldwide, invasive vertebrate eradication campaigns are increasing in scale and complexity, requiring improved decision making tools to achieve and validate success. For managers of these campaigns, gaining access to timely summaries of field data can increase cost-efficiency and the likelihood of success, particularly for successive control-event style eradications. Conventional data collection techniques can be time intensive and burdensome to process. Recent advances in digital tools can reduce the time required to collect and process field information. Through timely analysis, efficiently collected data can inform decision making for managers both tactically, such as where to prioritise search effort, and strategically, such as when to transition from the eradication phase to confirmation monitoring. Aims We highlighted the advantages of using digital data collection tools, particularly the potential for reduced project costs through a decrease in effort and the ability to increase eradication efficiency by enabling explicit data-informed decision making. Methods We designed and utilised digital data collection tools, relational databases and a suite of analyses during two different eradication campaigns to inform management decisions: a feral cat eradication utilising trapping, and a rodent eradication using bait stations. Key results By using digital data collection during a 2-year long cat eradication, we experienced an 89% reduction in data collection effort and an estimated USD42 845 reduction in total costs compared with conventional paper methods. During a 2-month rodent bait station eradication, we experienced an 84% reduction in data collection effort and an estimated USD4525 increase in total costs. Conclusions Despite high initial capital costs, digital data collection systems provide increasing economics as the duration and scale of the campaign increases. Initial investments can be recouped by reusing equipment and software on subsequent projects, making digital data collection more cost-effective for programs contemplating multiple eradications. Implications With proper pre-planning, digital data collection systems can be integrated with quantitative models that generate timely forecasts of the effort required to remove all target animals and estimate the probability that eradication has been achieved to a desired level of confidence, thus improving decision making power and further reducing total project costs.

scholarly journals A Distortion-Free Data Hiding Scheme for Triangular Meshes Based on Recursive Subdivision

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Yuan-Yu Tsai
Keyword(s):  
Principal Component Analysis ◽  
Data Hiding ◽  
Similarity Transformation ◽  
Principal Component ◽  
Secret Message ◽  
Subdivision Scheme ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Free Data ◽  
Reversible Data Embedding

This study adopts a triangle subdivision scheme to achieve reversible data embedding. The secret message is embedded into the newly added vertices. The topology of added vertex is constructed by connecting it with the vertices of located triangle. For further raising the total embedding capacity, a recursive subdivision mechanism, terminated by a given criterion, is employed. Finally, a principal component analysis can make the stego model against similarity transformation and vertex/triangle reordering attacks. Our proposed algorithm can provide a high and adjustable embedding capacity with reversibility. The experimental results demonstrate the feasibility of our proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document