TABLE OF CONTENTS

1. INTRODUCTION
1.1 ORGANIZATION PROFILE
1.2 SYSTEM SPECIFICATION
1.2.1. HARDWARE CONFIGURATION
1.2.2 SOFTWARE SPECIFICATION
2. SYSTEM STUDY
2.1 EXISTING SYSTEM
2.1.1 DRAWBACKS OF EXISTING SYSTEM
2.2 PROPOSED SYSTEM
2.2.1 ADVANTAGES OF PROPOSED SYSTEM
2.3 MODULE DESCRIPTION
3. SYSTEM DESIGN AND DEVELOPMENT
3.1 FILE DESIGN
3.2 INPUT DESIGN
3.3 OUTPUT DESIGN
4. TESTING AND IMPLEMENTATION
5. CONCLUSION
5.1SCOPE FOR FUTURE ENHANCEMENT
6. BIBLIOGRAPHY
7.APPENDICES
DATA FLOW DIAGRAM
TABLES
SAMPLE CODING
SCREEN SHOTS
REPORTS
 ABSTRACT
Secure embedding means the embedded watermark must not be easily tampered with, forged,
or removed from the watermarked data. Imperceptible embedding means that the presence of the
watermark is unnoticeable in the data. The watermark detection is blinded, that is, it neither
requires the knowledge of the original data nor the watermark. Watermarking techniques have
been developed for video, images, audio, and text data and also for software and natural
language text. The watermarking problem was formulated as a constrained optimization problem
that maximizes or minimizes a hiding function based on the bit to be embedded. These
techniques, however, are not very resilient to watermark attacks. Watermarking Algorithm using
Least significant bit does not provide a mechanism for multi-bit watermarks. Only secret key is
used. For each tuple, a secure message authenticated code (MAC) is computed using the secret
key and the tuple’s primary key. The computed MAC is used to select candidate tuples,
attributes, and the LSB position in the selected attributes. Hiding bits in LSB is efficient. In this
paper, we present a watermarking technique for relational data that is highly resilient compared
to these techniques. This technique is resilient to tuple deletion, alteration, and insertion attacks.
Ownership protection on relational databases – shared with collaborators (or intended
recipients) – demands developing a watermarking scheme that must be able to meet four
challenges: (1) it should be robust against different types of attacks that an intruder could launch
to corrupt the embedded watermark; (2) it should be able to preserve the knowledge in the
databases to make
them an effective component of knowledge-aware decision support systems; (3) it should try to
strike a balance between the conflicting requirements of database owners, who require soft
usability constraints, and database recipients who want tight usability constraints that ensure
minimum distortions in the data; and (4) last but not least, it should not require that a database
owner defines usability constraints for each type of application and every recipient separately.
The major contribution of this paper is a robust and efficient watermarking scheme for relational
databases that is able to meet all above-mentioned four challenges. The results of the proposed
experiments prove that the proposed scheme achieves 100% decoding accuracy even if only one
watermarked row is left in the database.