Problem statement: Digital multimedia watermarking technology was suggested in the last decade to embed copyright information in digital objects such images, audio and video. However, the increasing use of relational database systems in many real-life applications created an ever increasing need for watermarking database systems. As a result, watermarking relational database systems is now merging as a research area that deals with the legal issue of copyright protection of database systems. Approach: In this study, we proposed an efficient database watermarking algorithm based on inserting binary image watermarks in non-numeric mutli-word attributes of selected database tuples. Results: The algorithm is robust as it resists attempts to remove or degrade the embedded watermark and it is blind as it does not require the original database in order to extract the embedded watermark. Conclusion: Experimental results demonstrated blindness and the robustness of the algorithm against common database attacks.

/pdf/robust-and-blind-watermarking-of-relational-database-systems-3u70oa3l25.pdf

Robust and Blind Watermarking of Relational Database Systems

. A reversible watermarking scheme for relational databases is proposed in this paper to achieve lossless and exact authentication of relational databases via expansion on data error histogram. This reversi-ble watermarking scheme possesses the ability of perfect restoration of the original attribute data from the un-tampered watermarked relational databases, thus guaranteeing a “clear and exact” tampered-or-not authenti-cation without worry about causing any permanent distortion to the database. In this scenario, only the secret key owner possesses the capability to exactly restore the database’s original state. Simulations demonstrate the scheme’s security and feasibility for low-correlated data in typical databases. Keywords: reversible watermark, digital watermarking, relational databases 1 Introduction Security is of increasing concern with databases for database’s high added values and extensive installation in modern information systems. In addition to encryption, watermarking techniques is practically proven as another possible solution to enhance databases’ content security especially for copyright protection [1-6] and data tam-pering detection [7]. Unlike encryption or hash description, typical watermarking techniques modify original data as a modulation of the watermark information, and inevitably cause permanent distortion to the original data, and therefore cannot meet the integrity requirement of the data in some applications. This underlying defect can be relieved by reversible watermarking techniques [8-22] by their reversibility in both robust watermarking [8,9] and fragile watermarking [10-18]. The direct beneficiary from this reversibility is those applications requiring zero permanent distortions such as medical imaging, military imaging, forensics of documents and art work au-thentication. On the other hand, the perfect restoring ability realizes watermarking based lossless authentication which accounts for the major part of earlier algorithms [8-11]. In recent years, researches on reversible water-marking center on increasing embedding capacity to meet requirements of large volume data embedding [12-18]. In the meanwhile, its applications reach to non-raster image fields [20-22]. However so far, almost all the re-versible watermarking schemes exploit high correlation among neighboring data samples, and therefore face difficulty in the application of relational databases which usually contains only low-correlated, or even in the extreme case, completely random generated data. Some schemes were proposed [1-6] to watermark relational databases for copyright protection, which are based on the facts that the relational data have enough redundancy and can tolerate some unnoticeable degrada-tion in data precision caused by watermark embedding. The targets of the papers [1-6] are to verify the copyright of the relational data and the ownership of the owner, and the fragile watermarking scheme algorithm proposed in [7] is to detect and localize the tampered area of relational data, which however, inevitably introduces permanent distortion to the cover data.

Reversible Watermarking for Relational Database Authentication

With the development of Internet technology and human computing, the computing environment has changed dramatically over the last three decades. Cloud computing emerges as a paradigm of Internet computing in which dynamical, scalable and often virtualized resources are provided as services. With virtualization technology, cloud computing offers diverse services (such as virtual computing, virtual storage, virtual bandwidth, etc.) for the public by means of multi-tenancy mode. Although users are enjoying the capabilities of super-computing and mass storage supplied by cloud computing, cloud security still remains as a hot spot problem, which is in essence the trust management between data owners and storage service providers. In this paper, we propose a data coloring method based on cloud watermarking to recognize and ensure mutual reputations. The experimental results show that the robustness of reverse cloud generator can guarantee users' embedded social reputation identifications. Hence, our work provides a reference solution to the critical problem of cloud security.

A method for trust management in cloud computing: Data coloring by cloud watermarking

The importance of digital watermarking for digital assets such as relational databases to preserve their copyrights is becoming more and more important as time goes by. In the past few years, a large number of techniques have been proposed for hiding copyright marks specifically on relational databases. In this paper, we present an effective watermarking technique for relational data that is robust against various attacks. While previous techniques have been mainly concerned with introducing errors into the actual data, our approach inserts new tuples that are not real and we call them "fake" tuples, to the relation as watermarks. We will show that our approach leads to an effective technique that is robust against different forms of malicious attacks as well as benign updates to the data.

https://lasr.cs.ucla.edu/vahab/resources/watermarking.pdf

A new watermarking approach for relational data

This paper studies a novel scheme of watermarking relational databases for copyright protection. Speech signal is introduced as watermark to be embedded into the relations; associated novel watermark insertion algorithm and detection algorithm are proposed. Thus, the watermark signal in this method is expected to be more meaningful and has closer correlative to the copyright holder. Experimental results verify that the proposed method is feasible, effective and robust.

A Speech Based Algorithm for Watermarking Relational Databases

As an embranchment of information hiding, the digital watermark techniques have been attracting more and more interests in both research and industrial fields. As a tool for storing and managing data, relational database is widely used in many information systems. It is a crucial issue to protect the copyright of relational data. In order to make watermarking information more intuitive and easier to identify, We propose a novel watermarking method, which embeds an image watermark into relational database. Experimental results verify the effectiveness of the proposed method.

Xiao-Ming Jin

Papers

Watermarking relational database using image