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

Copyright Protection through Digital Watermarking

2011 ◽  
pp. 66-72
Author(s):  
Farook Sattar ◽  
Dan Yu
Keyword(s):  
Digital Watermarking ◽  
Copyright Protection ◽  
Multimedia Data ◽  
Global Network ◽  
The Internet ◽  
Watermark Embedding ◽  
Multimedia Distribution ◽  
Data Tracking ◽  
Illegal Copying ◽  
Watermarking Scheme

Today, the Internet is a worldwide broadcasting capability, a mechanism for information dissemination and a medium for collaboration and interaction between individuals and their computers without regard for geographic location. With the rapid evolution of digital networks, digital libraries and World Wide Web (WWW) services, the convenient broadcasting or exposition of digital products on the global network leads easily to illegal copying, modifying and retransmission. The Internet has spawned many copyright issues involving multimedia content distribution. Let’s say an owner would like to sell or distribute a work to legal/registered users only. If the work were subsequently copied/redistributed illegally, how could the owner find who was responsible? Cryptographic techniques provide an effective solution for securing the delivery process and controlling the use of the contents that an user has obtained. However, with flawless transmission through the network, the contents after decryption are exactly the same as the original data. The contents can be copied perfectly infinite times. A user can also manipulate the contents. Digital watermarking (Arnold, Schmucker, & Wolthusen, 2003; Katzenbeisser & Petitcolas, 2000) offers a way to counter copyright piracy on global networks that are not solvable by cryptography. It provides proof and tracking capabilities to illegal copying and distribution of multimedia information. Most existing digital watermarking schemes are based on some assumptions for watermark detection and extraction. Some schemes require the previous knowledge of watermark locations, strengths or some thresholds. In some algorithms, the watermark is estimated with the help of the original watermark information. To ensure the robustness and invisibility of the watermark, the optimum embedding locations are usually different for different images. For a large image database, it could be a disadvantage to require watermark location and strength information for watermark detection and extraction. A large amount of information then needs to be stored. On the Internet, an owner would like to distribute multimedia data by signing different watermarks to different users in order to prevent illegal redistribution of the data by a legal user. In this scenario, watermark detection and extraction algorithms requiring information of either watermark embedding locations and strengths or the original watermark should fail, since one does not know exactly which watermark is embedded in a particular copy of the watermarked image. To this end, we present a new blind watermarking scheme (Yu, Sattar, & Ma, 2002; Yu & Sattar, 2003, 2005) based on Independent Component Analysis (ICA) (Hyvarinen, 1999; Hyvärinen & Oja, 1999; Lee, 1998) for color images, which can overcome existing problems of watermark detection and extraction as described above. The new ICA-based scheme is found to be efficient in the application of data tracking/tracing for multimedia distribution through the Internet against other digital watermarking schemes. By adopting this ICA-based watermarking scheme, an efficient multimedia distribution framework/protocol for copyright protection can be accomplished. This article is organized as follows: The watermark embedding and extraction algorithms for color image watermarking using the new ICA-based scheme are presented next, followed by a discussion and comments on the results, security issues, summary and future works.

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.

Cloud Computing Security Issues of Sensitive Data

2019 ◽  
pp. 60-84
Author(s):  
Manpreet Kaur Walia ◽  
Malka N. Halgamuge ◽  
Nadeesha D. Hettikankanamage ◽  
Craig Bellamy
Keyword(s):  
Cloud Computing ◽  
Business Education ◽  
The Internet ◽  
Sensitive Data ◽  
Number Of Solutions ◽  
Privacy And Security ◽  
Cloud Computing Security ◽  
Unauthorized Access ◽  
Security Issues ◽  
The Internet Of Things

Numerous organizations are using aspects of the cloud to store data, but as sensitive data is placed on the cloud, privacy and security become difficult to maintain. When users upload data to the cloud, they may become increasingly vulnerable to account hijacking, unauthorized access, and the data may become unavailable because of various technical reasons. Questions remain about the security of sensitive data in the cloud, and in this chapter, the authors perform an analysis of 36 peer reviewed publications describing 30 observations of cloud computing technology (2010-2017). In the articles, applications of cloud computing include, for instance, business (26%) and the internet of things (IoT; 2%), and the result suggests that some issues are unique to a particular domain (such as business, education, health) and some issues cross all domains. The results suggest that data integrity issues have the highest number of solutions whereas data breaches have the lowest number of solutions.

A Print-Scan Resilient Watermarking Scheme Based on the Numbers of the DCT Positive and Negative Coefficients

2013 ◽  
Vol 310 ◽  
pp. 650-655
Author(s):  
Yun Fei Jiang ◽  
Yong Gang Fu
Keyword(s):  
Digital Watermarking ◽  
Copyright Protection ◽  
The Internet ◽  
Trade Off ◽  
Digital Multimedia ◽  
Positive And Negative Coefficients ◽  
Watermarking Scheme

Copyright protection has drawn much attentions especially in the advent of computer and the internet. Illagal copying of digital multimedia has been much easier because of widely using of the modern technologies.This paper proposes a novel digital watermarking algorithm based on the numbers of the blocked middle DCT positive and negative coefficients. Embedding watermark into the middle frequency of DCT is a perfect idea and it can receive a trade-off between robustness and imperceptibility.We utilized the embedding strength to get a balance between their robustness and imperceptibility. The results show that the algorithm is robust to print and scan process.

scholarly journals A Survey on Robust Video Watermarking Algorithms for Copyright Protection

2018 ◽  
Vol 8 (10) ◽  
pp. 1891 ◽  
Author(s):  
Xiaoyan Yu ◽  
Chengyou Wang ◽  
Xiao Zhou
Keyword(s):  
Copyright Protection ◽  
Quantitative Estimation ◽  
Video Watermarking ◽  
The Internet ◽  
Basic Information ◽  
Robust Watermarking ◽  
Digital Videos ◽  
Evaluation Indexes ◽  
Healthy Development ◽  
Live Broadcast

With the development and popularization of the Internet and the rise of various live broadcast platforms, digital videos have penetrated into all aspects of people’s life. At the same time, all kinds of pirated videos are also flooding the Internet, which seriously infringe the rights and interests of video copyright owners and hinder the healthy development of the video industry. Therefore, robust video watermarking algorithms for copyright protection have emerged as these times require. In this paper, we review robust video watermarking algorithms for copyright protection based on original videos and compressed videos. Basic models and properties of video watermarking algorithms are described, and the evaluation indexes corresponding to each property are also introduced. To help researchers understand various existing robust watermarking algorithms quickly, some basic information and the quantitative estimation of several performances are analyzed and compared. Finally, we discuss the challenges in the research of robust video watermarking algorithms, and give possible development directions for the future.

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.

Sign in / Sign up

Export Citation Format

Share Document