1. Fragile Watermarking Scheme for Relational Database Fragile Watermarking Scheme for Relational Database

2. Objective Aim of the project is to provide copyrights to relational databases using fragile watermarking scheme.

3. Abstract As more and more databases are published on the internet nowadays, it is increasingly important to maintain the security of published databases. In this Project, we propose a distortion-free scheme for embedding and verifying integrity information for relational databases. The proposed scheme does not require any additional storage to store the integrity verification information, nor does it introduce any distortion to the original data. Meanwhile, the tampered area can be localized precisely at a block level. Experimental results indicate that our scheme has adequate performance to allow for its use in real world applications

4. Existing System Database integrity has long been considered one of the three pillars in the database security arena, together with authentication and authorization (access control). But the research of database integrity mainly focuses on semantic integrity constraints, which are rules defining the correct states of the database. Traditional approaches use verification information such as message authentication codes (MAC) and signatures for integrity check. The verification information is often stored separately from the relating data. Since additional storage is required, they are subject to deletion attacks in which the verification information is simply deleted.

6. Proposed System Proposed System In this Project, we focus on how to improve the localization accuracy of fragile database watermark. A novel fragile watermarking scheme is proposed for relational databases by manipulating the order and grouping information among database entities. Combing row signature with attribute signature in tamper localization, tampered areas can be pinpointed at the block level. The proposed scheme does not require any additional storage, nor does it introduce any distortion to the original data. There is also no limit to the data type of database.

7. Watermarking embeds ownership information in digital content. Here the embedding is hidden that the presence of watermarking is invisible to the user. There is also no limit to the data type of database

8. SERVER (SOURCE) MODULE CLIENT (DESTINATION) MODULE 7/13/20168 THE MODULES ASSOCIATED WITH THIS PROJECT ARE

9. Main Form has controls like select Table Name Destination DBCON – This class establishes a connection to the database using SQL SERVER. ACTION CONTROLLER – This class initiates the process by accessing the data table. PARTITION – First, an original database is divided into some row groups and column groups. Then, information for integrity verification can be hidden in each group by manipulating the sequential order of rows or columns. Embedding capacity depends on the number of entities in each group and then the data is divided into partition information 7/13/20169 SERVER (SOURCE) MODULE THIS MODULE INCLUDES CLASSES SUCH AS SERVER (SOURCE) MODULE THIS MODULE INCLUDES CLASSES SUCH AS

10. SINGLE BIT ENCODING – This class encodes the partitioned data by adding one bit to each record. ENCRYPTION – This class gets all the encoded records and encrypts them as a whole data along the secret key. WATERMARK SERIALIZATION – This class serialize(Convert The Object into data)and sends it to the destination via network connections. 7/13/201610

11. MAIN FORM – This class receives the data from source through thread. WATERMARK DESERIALIZE –This class reads the received data and convert the stream as file. DECRYPTION – This class decrypts the data using the secret key. 7/13/201611 CLIENT (DESTINATION) MODULE THE CLASSES OF THIS MODULE DOES THE REVERSE ENGINEERING OF THE SOURCE MODULE

12. SINGLE BIT DECODING – This class gets the data as an object from the Hash Table using the key value added to it and also decodes the data by removing the additional bit added to each record. REVERSE PARTITION – All of the rows and attributes are first divided into a number of groups based on their entity hash values. This process is the same as that in the process of embedding verification information as in embedding algorithm. The entities are queued into each group without changing their relative sequential order. This class merge the partitioned data or records into a single data. DATA INSERT –This class reads each record and stores it in Hash Table and which in turn is inserted into the Database one by one using SQL SERVER. 7/13/201612

13. MINIMUM HARDWARE REQUIREMENTS: SYSTEM: Pentium IV 2.4 GHz HARD DISK: 40 GB FLOPPY DRIVE: 1.44 MB MONITOR: 15 VGA colour MOUSE: Logitech. RAM: 256 MB KEYBOARD : 110 keys enhanced.

14. Software Specification SOFTWARE REQUIREMENTS Operating system :- Windows XP Professional Framework :- Microsoft Visual Studio.Net 2005 Coding Language: - C#.net 2005. Back End:- Sql Server 2000