Data Integrity Proofs in Cloud Storage Abstract Cloud computing has been envisioned as the de-facto solution to the

rising storage costs of IT Enterprises. With the high costs of data storage devices as well as the rapid rate at which data is being generated it proves costly for enterprises or individual users to frequently update their hardware. Apart from reduction in storage costs data outsourcing to the cloud also helps in reducing the maintenance. Cloud storage moves the users data to large data centers, which are remotely located, on which user does not have any control. However, this unique feature of the cloud poses many new security challenges which need to be clearly understood and resolved. One of the important concerns that need to be addressed is to assure the customer of the integrity i.e. correctness of his data in the cloud. As the data is physically not accessible to the user the cloud should provide a way for the user to check if the integrity of his data is maintained or is compromised. In this paper we provide a scheme which gives a proof of data integrity in the cloud which the customer can employ to check the correctness of his data in the cloud. This proof can be agreed upon by both the cloud and the customer and can be incorporated in the Service level agreement (SLA). This scheme ensures that the storage at the client side is minimal which will be beneficial for thin clients.

Existing Work:

The simplest Proof of retrivability (POR) scheme can be made using a keyed hash function hk(F). In this scheme the verifier, before archiving the data file F in the cloud storage, precomputes the cryptographic hash of F using hk(F) and stores this hash as well as the secret key K. To check if the integrity of the file F is lost the verifier releases the secret key K to the cloud archive and asks it to compute and return the value of hk(F). By storing multiple hash values for different keys the verifier can check for the integrity of the file F for multiple times, each one being an independent proof.

Disadvantages:

Though this scheme is very simple and easily implementable the main drawback of this scheme are the high resource costs it requires for the implementation.

At the verifier side this involves storing as many keys as the number of checks it want to perform as well as the hash value of the data file F with each hash key. Also computing hash value for even a moderately large data files can be computationally burdensome for some clients(PDAs, mobile phones, etc ).

it requires that each proof requires the prover to read the entire file F - a significant overhead for an archive whose intended load is only an occasional read per file, were every file to be tested frequently.

y y y

Proposed System:

We present a scheme which does not involve the encryption of the whole data. We encrypt only few bits of data per data block thus reducing the computational overhead on the clients. The client storage overhead is also minimized as it does not store any data with it. Hence our scheme suits well for thin clients. In our data integrity protocol the verifier needs to store only a single cryptographic key irrespective of the size of the data file F- and two functions which generate a random sequence. The verifier does not store any data with it. The verifier before storing the file at the archive, preprocesses the file and appends some Meta data to the file and stores at the archive. At the time of verification the verifier uses this Meta data to verify the integrity of the data. It is important to note that our proof of data integrity protocol just checks the integrity of data i.e. if the data has been illegally modified or deleted. It does not prevent the archive from modifying the data. In order to prevent such modifications or deletions other schemes like redundant storing etc, can be implemented which is not a scope of discussion in this paper.

Advantages:

it a reliable solution to the problem of avoiding local storage of data

We encrypt only few bits of data per data block thus reducing the computational overhead on the clients.

The client storage overhead is also minimized as it does not store any data with it.

Data leakage Detection

1.1.1

Objective In this paper we develop a model for assessing the guilt of

agents. We also present algorithms for distributing objects to agents, in a way that improves our chances of identifying a leaker. Finally, we also consider the option of adding fake objects to the distributed set. Such objects do not correspond to real entities but appear realistic to the agents. In a sense, the fake objects acts as a type of watermark for the entire set, without modifying any individual members. If it turns out an agent was given one or more fake objects that were leaked, then the distributor can be more confident that agent was guilty.

Our goal is to estimate the likelihood that the leaked data came from the agents as opposed to other sources. Not only to we want to estimate the likelihood the agents leaked data, but we would also like to find out if one of them in particular was more likely to be the leaker. The main focus of our paper is the data allocation problem: how can the distributor intelligently give data to agents in order to improve the chances of detecting a guilty agent? there are four instances of this problem we address, depending on the type of data requests made by agents and whether fake objects are allowed. 1.2 Existing System Traditionally, leakage detection is handled by watermarking, e.g., a unique code is embedded in each distributed copy. If that copy is later discovered in the hands of an unauthorized party, the leaker can be identified. Watermarks can be very useful in some cases, but again, involve some modification of the original data. Furthermore, watermarks can sometimes be destroyed if the data recipient is malicious.

1.2.1

Drawbacks

y Proposed policies are restrictive y It may be make it impossible to satisfy agents requests. 1.3 Proposed System

In this paper, we have shown it is possible to assess the likelihood that an agent is responsible for a leak, based on the overlap of his data with the leaked data and the data of other agents, and based on the probability that objects can be guessed by other means. Our model is relatively simple, but we believe it captures the essential trade-offs. The algorithms we have presented implement a variety of data distribution strategies that can improve the distributors chances of identifying a leaker. We have shown that distributing objects judiciously can make a significant difference in identifying guilty agents, especially in cases where there is large overlap in the data that agents must receive.

Advantages:

 It improves the probability of identifying leakages.  Its further improves our chances of detecting leakage and identifying the guilty party.

System Requirements Software Requirements: Operating System Front End : Windows XP : Java 1.6, Swing

Programming tool : Netbeans Hardware Requirements: Processor Cache Memory HDD RAM Processor Speed Display Type Mouse Monitor : Intel Pentium IV : 1MB : 40 GB : 512 MB : 600 MHz : VGA : Logitech : 15 Samsung Color Monitor

Visual Cryptography Schemes for Secret Image

ABSTRACT: Visual cryptography is one of the technique used to encrypt the images by dividing the original image into transparencies. The transparencies can be sent to the intended person, and at the other end the transparencies received person can decrypt the transparencies using our tool, thus gets the original image. Our proposed Visual cryptography provides the demonstration to the users to show how encryption and decryption can be done to the images. In this technology, the end user identifies an image, which is not the correct image. That is, while transmitting the image the sender will encrypt the image using our application here sender gets the two or more transparencies of the same image. Our application provides an option to the end user of encryption. The end user can divide the original image into number of different images. Using our application we can send encrypted images that are in the format of GIF And PNG. The encrypted transparencies can be saved in the machine and can be sent to the intended person by other means [source].

Existing System:
Visual cryptography is the art and science of encrypting the image in such a way that no-one apart from the sender and intended recipient even realizes the original image, a form of security through obscurity. By contrast, cryptography obscures the original image, but it does not conceal the fact that it is not the actual image. Limitation:-The existing system does not provide a friendly environment to encrypt or decrypt the data (images).

Proposed System:
Proposed system Visual cryptography provides a friendly environment to deal with images. Generally cryptography tools supports only one kind of image formats. Our application supports .gif and .png (portable network graphics) formatted images and our application has been developed using swing and applet technologies, hence provides a friendly environment to users.

Problem Definition: When ever we transmit the data(image) in the network, any
unauthenticated person can read our data(image). In order to provide security to data(image) generally sender will encrypt the data(image) and send it the intended person and the receiver will decrypt the encrypted data(image) and uses it.

Hardware Requirements:
Processor: Intel or AMD processor computer RAM: 256 MB or more Hard Disk Space: 8 GB or more

Software Requirements:
Operating System: Windows X P Technologies: JAVA 6.0, Swing Tools: NetBeans 6.0

ROBUST VIDEO DATA HIDING USING FORBIDDEN ZONE DATA HIDING AND SELECTIVE EMBEDDING
ABSTRACT:
Video data hiding is still an important research topic due to the design complexities involved. We propose a new video data hiding method that makes use of ensure correction capability of Repeat Accumulate codes and superiority of Forbidden Zone Data Hiding. Selective embedding is utilized in the proposed method to determine host signal samples suitable for data hiding. This method also contains a temporal synchronization scheme in order to withstand frame drop and insert attacks. The proposed framework is tested by typical broadcast material against MPEG-2, H.264 compression, frame-rate conversion attacks, as well as other well-known video data hiding methods. The decoding error values are reported for typical system parameters. The simulation results indicate that the framework can be successfully utilized in video data hiding applications.

EXISTING SYSTEM:
y In special domain, the hiding process such as least significant bit(LSB) replacement, is done in special domain, while transform domain methods; hide data in another domain such as wavelet domain.

Least significant bit (LSB) is the simplest form of Steganography. LSB is based on inserting data in the least significant bit of pixels, which lead to a slight change on the cover image that is not noticeable to human eye. Since this method can be easily cracked, it is more vulnerable to attacks.

LSB method has intense affects on the statistical information of image like histogram. Attackers could be aware of a hidden communication by just checking the Histogram of an image. A good solution to eliminate this defect was LSB matching. LSB-Matching was a great step forward in Steganography methods and many others get ideas from it

PROPOSED SYSTEM:
y Data hiding in video sequences is performed in two major ways: bit stream-level and data-level.

In this paper, we propose a new block-based selective embedding type data hiding framework that encapsulates Forbidden Zone Data Hiding (FZDH)

By means of simple rules applied to the frame markers, we introduce certain level of robustness against frame drop, repeat and insert attacks. o ADVANTAGES      User cannot find the original data. It is not easily cracked. To increase the Security . To increase the size of stored data. We can hide more than one bit.

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

SOFTWARE REQUIREMENTS
Operating system Front End Tool : : : Windows XP Professional JAVA NetBeans IDE