Watermarking for Security in Database

Watermarking technology is used to embed copyright information in objects such as images, audio, video and databases. The increasing use of relational database systems in many real-life applications creates the need for database watermarking systems for protection of database. As a result, watermarking relational database system deals with the legal issue of copyright protection of database system. There are different types of databases like, Numerical and Categorical Databases. Working with numerical data is easier as compared to categorical databases which is much harder to work with. This report addresses a unique, robust copyright protection scheme for Relational Database. Watermark (Characteristic code) is a binary string calculated through the characteristic operation on the original database. A watermark is called robust if it resists a designated class of transformations. Robust watermarks may be used in copy protection applications to carry copy and access control information. The algorithm correlates characteristics according to the content of the databases, which can resist invertibility attack efficiently.Invertibility attack on database is being considered in this paper

Development of Data leakage Detection Using Data Allocation Strategies

Abstract-A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). Some of the data are leaked and found in an unauthorized place. The distributor must assess the likelihood that the leaked data came from one or more agents, as opposed to having been independently gathered by other means. We propose data allocation strategies (across the agents) that improve the probability of identifying leakages. These methods do not rely on alterations of the released data (e.g., watermarks). In some cases, we can also inject "realistic but fake" data records to further improve our chances of detecting leakage and identifying the guilty party. In previously only one agent is going to leak the data but by using allocation strategies we are going to create multiple agents. this project is possible to show in stand alone system, but now we are going to show the result dynamically using MVC architecture

Rights Protection for Relational Data Using Least Significant Bit Method

A solution for computer database content rights protection through watermarking. Rights protection for relative information is of ever-increasing interest, particularly considering areas wherever sensitive, valuable content is to be outsourced. A decent example could be a data processing application, wherever, information is sold in items to parties specialized in mining it. Totally different avenues are on the market, every with its own benefits and disadvantages. Social control by legal suggests that is sometimes ineffective in preventing thievery of proprietary works, unless increased by a digital counterpart, for instance, watermarking. Whereas, having the ability to handle higher level linguistics constraints, like classification preservation, our resolution additionally addresses necessary attacks, like set choice and random and linear information changes. We introduce wmdb.*, a proof-of-concept implementation and its application to real-life information, namely, in watermarking the outsourced Wal-Mart sales information that we have on the market at our institute

Secure Function Extensions to Additively Homomorphic Cryptosystems

The number-theoretic literature has long studied the question of distributions of sequences of quadratic residue symbols modulo a prime number. In this paper, we present an efficient algorithm for generating primes containing chosen sequences of quadratic residue symbols and use it as the basis of a method extending the functionality of additively homomorphic cryptosystems. We present an algorithm for encoding a chosen Boolean function into the public key and an efficient two-party protocol for evaluating this function on an encrypted sum. We demonstrate concrete parameters for secure function evaluation on encrypted sums up to eight bits at standard key sizes in the integer factorization setting. Although the approach is limited to applications involving small sums, it is a practical way to extend the functionality of existing secure protocols built on partially homomorphic encryption schemes