1.

INTRODUCTION

Current time is distributed computing time. Distributed computing has

massive variety of degree in data sharing in current period. Distributed
computing gives accurate measure of virtual environment concealing the stage
and working frameworks of the client. Client use the assets for exchanging
information. It may, client need to pay by the process of utilization of assets of
cloud. Now cloud admin distributors are putting forth cloud administrations
with ease furthermore with large dependability. Client can transfer the vast
sum data on cloud and exchanged information to a large number of clients.
Cloud suppliers are offer diverse administrations, for e.g., framework as an
administration, stage as an administration, and so forth. Client not has to buy
the assets. As the data is get exchanged by the client might be it is basic
notification to deal with this regularly expanding information on the cloud.
To make well information administration in the distributed computing.
We use duplication technique, which is the best technique in cloud. This
technique is turning out to be more moderation for information DE
duplication. This system is sending the information over the system required
little measure of information. This technique has application in information
administration and organizing. Information duplication is the procedure of
decreasing copy file Also it is the best pressure system for the information DE
duplication. This system has application in information administration and
organizing. Rather than keeping excess duplicate file of the same information
DE duplication just keep unique duplicate and give just references of the first
duplicate to the repetitive information. The process of checking the duplication
process is two; one is document level duplication check and second is piece
content level duplication check. In the document level duplication technique
check is expel the same name record from the capacity and square level DE
duplication are evacuated the copy pieces. DE duplication techniques need of
the some security system. In the conventional system client need to encode his
own particular information.

1
 Fig 1. Cloud architecture and services

To maintain a security from the unapproved information DE duplication

focalized information DE duplication is proposed to uphold the data privacy while
checking the information duplication. The cloud giving various administrations as
attended in the above figure, for example, stage, administrations, base as an
administration, and database as an administration. In this part we are utilizing as a part
of distributed storage as an administration
We are utilizing client accreditations to check the confirmation of the client. In that
cases cloud is available two sort of cloud such private cloud and open cloud. In private
cloud store the client accreditation and in the open cloud client information present
out. In the figure 2.

Fig 2. Hybrid Cloud Architecture.

2
 cloud take focal points of both open cloud and private cloud. Open cloud and
private cloud are available in the half and half cloud structural engineering. When any
client forward solicitation to people in general cloud to get to the data he have to
present his data to the private cloud then private cloud will give a record token and
client can get the notifications to the document lives on the general population cloud.
We have utilized a half and half cloud construction modeling as a part of proposed.
We have to need to mind the file name in record information duplication and
information DE duplication is checked at the square level. On the other hand, client
needs to recover his information or download the information record he have to
download both of the document from the cloud server this will prompts perform the
operation on the same record this abuses the security of the distributed storage.

3
 2. LITERATURE SURVEY

2.1 THEORETICAL BACKGROUND

(A) DupLESS: Server-Aided Encryption for Deduplicated Storage.

By looking the example Dropbox, Mozy, and others perform deduplication to

spare space by just putting away one duplicate of every document or file transferred.
Should customers routinely scramble their documents, be that as it may, funds are lost.
Messagebolted encryption (the most unmistakable appearance of which is concurrent
encryption) certify this strain. In any case it is intrinsically subject to savage power
assaults that can recoup records falling into a known set. We propose a building
design that accedes secure deduplicated stockpiling opposing savage power. assaults,
and acknowledge it in a framework called DupLESS. In DupLESS, customers encode
under message-based keys acquired from a key-server by means of an absent PRF
convention. It secures customers to store scrambled information with a current
administration, have the administration perform deduplication for their advantage, but
then accomplishes solid privacy ensures. We demonstrate that encryption for
deduplicated stockpiling can accomplish execution and space reserve funds near that
of consuming the stockpiling administration with plaintext information

(B) Fast and Secure Laptop Backups with Encrypted De-duplication.

Different types or individual data now store extensive amounts of individual and
corporate information on tablets or home PCs. By doing this type of work it is helpless
against burglary or equipment disappointment. Ordinary ideal arrangements are not
appropriate to this environment, and reinforcement administrations are every now and
again deficient.

4
 Fig 3. System diagram

This system depicts a calculation which exploits the information which is basic
between clients to build the pace of reinforcements, and decrease the capacity
necessities. This calculation bolsters customer end per-client encryption which is
essential for classified individual information. It likewise underpins a one of a kind
element which permits prompt location of normal sub trees, dodging the need to
question the reinforcement framework for each document. It means the same data uses
by different users have take large space and reduce the performance of your PC. We
portray a model usage of this calculation for Apple Operating System X, and present
an investigation of the potential viability, utilizing genuine information acquired from
an arrangement of ordinary clients. At last, we talk about the utilization of this model
in conjunction with remote distributed storage, and present an investigation of the
common place cost reserve funds.

5
(C) Secure Deduplication with Efficient and Reliable Convergent Key
Management.

Deduplication is a system for taking out copy duplicates of information, and has
been broadly utilized as a part of distributed storage to decrease storage space and
transfer data transfer capacity. Promising as it perhaps, an emerging test is to perform
secure deduplication in distributed storage. Albeit joined encryption has been widely
received for secure deduplication, a basic problem of making focalized encryption
down to earth is to productively and dependably deal with an immense number of
united keys. This system makes the first endeavor to formally notify the issue of
accomplishing effective and dependable key administration in secure deduplication.
Firstly we introduce a pattern approach in which every client holds an autonomous
expert key for scrambling the aim keys and outsourcing them to the cloud.

On the second way, such a standard key administration plan produces a

tremendous number of keys with the expanding number of obliges clients and clients
to dedicatedly secure the expert keys. To this end, we propose Dekey , another
development in which clients don't have to deal with any keys all alone however
rather safely circulate or transfer the united key shares over different servers. Security
examination exhibits that Dekey is secure as far as the definitions determined in
proposed security model. As a proof of idea, we actualize Dekey utilizing the Ramp
mystery sharing plan and show that Dekey brings about restricted overhead in
reasonable situations.

(D) Proofs of Ownership in Remote Storage Systems.

Distributed storage frameworks are turning out to be progressively prominent. A

promising innovation that holds their expense down is de-duplication, which stores
just a solitary duplicate of rehashing information. Customer side deduplication
endeavours to recognize deduplication opportunities as of now at the customer and
save the transmission capacity of transferring duplicates of the existing documents or
files to the server. After that process we looks assaults that endeavour customer side

6
de-duplication, permitting an aggressor to access self-assertive size records of
different clients in view of a few hash marks of these documents.

All the more particularly, an aggressor who knows the hash mark of a record can
persuade the capacity advantage that it possesses that document, henceforth the server
lets the assailant download the whole record. (In parallel to our work, a subset of these
assaults was as of late presented in the wild regarding the Dropbox record
synchronization administration.) To overcome of this problem, we present the thought
of verifications of-possession (PoWs), which lets a customer effectively present to a
server that that the customer holds a document, as opposed to simply some short data
about it. We formalize the concept of evidence of-proprietorship, under thorough
security definitions, and thorough productivity prerequisites of Petabyte scale
stockpiling frameworks. We then present arrangements in view of particular
encodings and Merkle trees, and investigate their security. We actualized one
variation of the plan. Our execution estimations show that the plan causes just a few
overhead contrasted with guileless customer side deduplication.

(E) RevDedup: A Reverse Deduplication Storage System Optimized for Reads to

Latest Backups.

Scaling up the reinforcement stock-piling for a perpetually expanding volume of

virtual machine (V.M.) images is a basic issue in virtualization situations. While
deduplication is known not dispose of copies for Virtual Machine picture capacity, it
additionally presents fracture that will corrupt read execution.

We propose RevDedup, a deduplication framework that upgrades peruses to most

recent VM picture reinforcements utilizing a thought called reverse deduplication.
Conversely with traditional deduplication that describe copies from new information,
RevDedup describe copies from old information, in this way moving odd to old
information while keeping the design of new information as consecutive as would be
prudent.

7
 Figure 5. Reverse duplication example

We assess our RevDedup model utilizing miniaturized scale benchmark and

certifiable workloads. For a 12- week compass of certifiable VM pictures from 160
users, RevDedup accomplishes high deduplication productivity with around 97% of
sparing, and high reinforcement and read throughput on the request of 1GB/s.
RevDedup additionally brings about little metadata overhead in reinforcement/read
operations. The security of private information deduplication conventions is
formalized in the recreation based system in the connection of two-gathering
calculations.

8
(F) Private Data Deduplication Protocols in Cloud Storage

Another idea namely call private information deduplication convention, a

deduplication system for private information stockpiling is presented and formalized.
Naturally, a private information deduplication convention allow a customer who holds
a private information demonstrates to a server who have a synopsis string of the
information that he/she is the proprietor of that information without uncovering
additional data to the server. Our idea can be seen as a supplement of the cutting edge
open information deduplication conventions of Halevyal.

A development of private deduplication conventions in view of the standard

cryptographic suspicions is then introduced and examined. We demonstrate that the
proposed private information deduplication convention is provably secure accepting
that the basic hash capacity is crash flexible, the discrete logarithm is hard and the
eradication coding calculation can deletion up to α-division of the bits in the vicinity
of malignant enemies in the vicinity of vindictive foes. To the best our insight this is
the first deduplication convention for private information stockpiling.

2.2 EXIXTING SYSTEM

When a user uploads data that already exist in the cloud storage, the user
should be deterred from accessing the data that were stored before he obtained the
ownership by uploading it (backward secrecy)2. These dynamic ownership changes
may occur very frequently in a practical cloud system, and thus, it should be properly
managed in order to avoid the security degradation of the cloud service. In the former
approach, most of the existing schemes have been proposed in order to perform a
PoW process in an efficient and robust manner, since the hash of the file, which is
treated as a “proof” for the entire file, is vulnerable to being leaked to outside
adversaries because of its relatively small size. a data owner uploads data that do not
already exist in the cloud storage, he is called an initial uploader; if the data already
exist, called a subsequent uploader since this implies that other owners may have
uploaded the same data previously, he is called a subsequent uploader.

9
Disadvantages of Existing System

User deduplication on the client-side, cannot generate a new tag when they update the
file. In this situation, the dynamic Ownerships would fail. As a summary, existing
dynamic Ownerships cannot be extended to the multi-user environment. Whenever
data is transformed, concerns arise about potential loss of data. By definition, data
deduplication systems store data differently from how it was written. As a result, users
are concerned with the integrity of their data. One method for deduplicating data relies
on the use of cryptographic hash functions to identify duplicate segments of data. If
two different pieces of information generate the same hash value, this is known as a
collision. The probability of a collision depends upon the hash function used, and
although the probabilities are small, they are always non zero.

2.3 MODULES

In this project we have following Four modules .

i).Data Provider
ii).Cloud
iii).Deduplicaion
iv).Attribute Authority

Data Provider

Data provider uploading file to cloud with tag , label and security key , the
proposed scheme guarantees data integrity against any tag inconsistency attack. Thus,
security is enhanced in the proposed scheme.

Cloud Storage

Secure Deduplication with the goal of saving storage spacefor cloud storage
services, Douceur et al the first solution for balancing confidentiality and efficiency in

10
performing deduplication called convergent encryption, where a message is encrypted
under a message-derived key so that identical plaintexts are encrypted to the same
ciphertexts. In this case, if two users upload the same file, the cloud server can discern
the equal ciphertexts and store only one copy of them. which may violate the privacy
of the data if the cloud server cannot be fully trusted . This is a client who owns data,
and wishes to upload it into the cloud storage to save costs. A data owner encrypts the
data and outsources it to the cloud storage with its index information, that is, a tag.

Deduplication

Data deduplication is a specialized data compression technique for eliminating

duplicate copies of repeating data. Related and somewhat synonymous terms are
intelligent (data) compression and single-instance (data) storage. This technique is
used to improve storage utilization and can also be applied to network data transfers to
reduce the number of bytes that must be sent. In the deduplication process, unique
chunks of data, or byte patterns, are identified and stored during a process of analysis.
Deduplication techniques take advantage of data similarity to identify the same data
and reduce the storage space. In contrast, encryption algorithms randomize the
encrypted files in order to make ciphertext indistinguishable from theoretically
random data.

Attribute Authority
The AA issues every user a decryption keyassociated with user set of attributes
At the user side, each user can download an item, and decrypt the ciphertext with the
attribute-based private key generated by the AA if this user’s attribute set satisfies the
access structure.

11
2.5 SPECIFICATION

HARDWARE REQUIREMENTS:

System : Pentium Dual Core.

Hard Disk : 20 GB.
Monitor : 15’’ LED
Input Devices : Keyboard, Mouse
Ram : 1 GB

SOFTWARE REQUIREMENTS:

Operating system : Windows 7.

Coding Language : JAVA/J2EE
Tool : Netbeans 7.2.1
Database : MYSQL

12
 3. SYSTEM DESIGN

3.1 SYSTEM ARCHITECTURE

3.2 DATA FLOW DIAGRAMS

An information stream design (DFD) is a graphical portrayal of the "stream" of
information through a data framework, demonstrating its strategy edges. A DFD is a
significant part of the time utilized as a preparatory stroll to make an overview of the
framework, which can later be cleared up. DFDs can in like way be utilized for the
depiction of information prepare. A DFD indicates what sort of data will be sense of
duty regarding and yield from the structure, where the information will begin from
and go to, and where the information will be secured. It doesn't demonstrate data

13
about the organizing of process or data about whether strategy will work in game-plan
or in parallel.

DFD SYMBOLS
In the DFD, there are four symbols
A square defines a source or destination of system data.

An arrow identifies data flow. It is the pipeline through which the information
flows.
A circle represents a process that transforms incoming data flow into outgoing
data flow.

An open rectangle is a data store, data at rest or a temporary repository of data.

14
 Fig : Data Flow Diagram

3.3 UML DIAGRAMS

The unified modeling language is the standard language for writing software
blueprints. The UML is a language for:
•Visualizing
•Specifying
•Constructing
•Documenting the artifacts of a software intensive system
The UML is a dialect which gives vocabulary and the guidelines to joining
words in that vocabulary with the end goal of correspondence. A displaying is a
dialect whose vocabulary and the guidelines concentrate on the theoretical and
physical portrayal of the system.UML is a method for imagining a product program
utilizing a gathering of graphs. The documentation has advanced the work of Grady
Booch, James Rumbaugh, Ivar Jacobson and the Rational Software Corporation to be
utilized for question situated outline.

15
3.3.1 USE CASE DIAGRAM

A Use case outline is the UML is a sort of conduct graph characterized by and made
by a use case analysis. The fundamental motivation behind a use case chart is to
indicate what framework capacities are performed for which on-screen character.
Utilize case chart demonstrates an arrangement of utilization cases and performing
artists and their connections. They address the static outline perspective of the
framework. They are particularly essential in sorting out and demonstrating the
practices of a framework.

Fig. (4) Use case diagram of ABE

16
3.3.2 CLASS DIAGRAM

Class graph demonstrates an arrangement of classes, interfaces and joint

efforts and their connections. They address the static plan perspective of the
framework. Class graph that incorporate classes address the static procedure
perspective of a framework. The class outlines are broadly utilized as a part of the
demonstrating of question arranged frameworks since they are the main UML charts
which can be mapped specifically with protest situated dialects. The class outline
demonstrates a gathering of classes, interfaces, affiliations, coordinated efforts and
limitations.

Fig 4.5 Cl ass Diagram

17
3.3.3 SEQUENCE DIAGRAM

Grouping graph underscores on time succession of messages and cooperation

chart stresses on the basic association of the articles that send and get messages.
Succession chart is a collaboration graph that accentuates the time-requesting of
messages. Arrangement graphs and coordinated effort charts are isomorphic, implying
that you can take one and change it into other. It tells which move is made first thus
grouping activities are spoken to unmistakably in this chart.

Fig 4.7 Sequence Diagram

18
3.3.4 COLLABORATION DIAGRAM

The Collaboration outline depicts the association of items in a framework

participating in the message stream. The technique calls are like that of a succession
outline. In any case, the distinction is that the succession chart does not depict the
question association where as the coordinated effort outline demonstrates the protest
association. Presently to pick between these two charts the fundamental accentuation
is given on the kind of prerequisite.

Fig : Collaboration Diagram

19
 4. IMPLEMENTATION
SYSTEM ARCHITECTURE

DATA PROVIDER
In this module, initially the data owner has to register to the cloud server and get
authorized. After the authorization from cloud data owner will encrypt and add file to
the cloud server where in after the addition of file data owner requests the content key and
the master secret key to the authority for the file he uploaded ,only after the keys
generated the file is uploaded to the cloud server. After the uploading of the file the data
owner will have to provide download and the search permission for individual file for the
users to perform search and download.

20
CLOUD SERVER
The cloud server manages a cloud to provide data storage service. Data owners
encrypt their data files and store them in the cloud for sharing with cloud End users. To
access the shared data files users will request the permission of content key and the MSK
master secret key. And the cloud will provide the permission and also views all the
transactions and attackers related to the files.

ATTRIBUTE AUTHORITY
Authority generates the content key and the secret key requested by the end user.
Authority can view all files with the content key and master secret key generated with the
corresponding data owner details of the particular file.

USER
User has to register and login for accessing the files in the cloud. User is
authorized by the cloud to verify the registration. User has to request for the MSK master
secret key and content key to download the file. User can only download and search the
file if the data owner of the particular file has provided the permissions.

21
 5. CODING

Authority Login.html

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"

"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" class="cufon-active cufon-ready">

<head>
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<title>Authority Login</title>
<link href="./Authority Login_files/style.css" rel="stylesheet" type="text/css">
<script type="text/javascript" src="./Authority Login_files/cufon-
yui.js.download"></script>
<style type="text/css">
cufon {
text-indent: 0!important;
}

@media screen,
projection {
cufon {
display: inline!important;
display: inline-block!important;
position: relative!important;
vertical-align: middle!important;
font-size: 1px!important;
line-height: 1px!important;
}
cufon cufontext {
display: -moz-inline-box!important;
display: inline-block!important;
width: 0!important;

22
 height: 0!important;
overflow: hidden!important;
text-indent: -10000in!important;
}
cufon canvas {
position: relative!important;
}
}

@media print {
cufon {
padding: 0!important;
}
cufon canvas {
display: none!important;
}
}
</style>
<script type="text/javascript" src="./Authority
Login_files/arial.js.download"></script>
<script type="text/javascript" src="./Authority
Login_files/cuf_run.js.download"></script>
<style type="text/css">
<!-- .style24 {
color: #FF0000;
font-size: 24px;
}

.style25 {
color: #FF0000
}

-->
</style>

23
</head>

<body>
<div class="main">
<div class="header">
<div class="header_resize">
<div class="logo">
<h1><a
href="http://localhost:8081/Attribute_basedStorageSupport/index.html"
class="style24"><cufon class="cufon cufon-canvas" alt="Attribute-Based "
style="width: 173px; height: 24px;"><canvas width="224" height="32" style="width:
224px; height: 32px; top: -5px; left: -16px;"></canvas><cufontext>Attribute-Based
</cufontext></cufon><cufon class="cufon cufon-canvas" alt="Storage "
style="width: 91px; height: 24px;"><canvas width="143" height="32" style="width:
143px; height: 32px; top: -5px; left: -16px;"></canvas><cufontext>Storage
</cufontext></cufon><cufon class="cufon cufon-canvas" alt="Supporting "
style="width: 123px; height: 24px;"><canvas width="175" height="32" style="width:
175px; height: 32px; top: -5px; left: -16px;"></canvas><cufontext>Supporting
</cufontext></cufon><cufon class="cufon cufon-canvas" alt="Secure " style="width:
83px; height: 24px;"><canvas width="135" height="32" style="width: 135px; height:
32px; top: -5px; left: -16px;"></canvas><cufontext>Secure
</cufontext></cufon><cufon class="cufon cufon-canvas" alt="Deduplication "
style="width: 153px; height: 24px;"><canvas width="204" height="32" style="width:
204px; height: 32px; top: -5px; left: -16px;"></canvas><cufontext>Deduplication
</cufontext></cufon><cufon class="cufon cufon-canvas" alt="of " style="width:
27px; height: 24px;"><canvas width="79" height="32" style="width: 79px; height:
32px; top: -5px; left: -16px;"></canvas><cufontext>of </cufontext></cufon><cufon
class="cufon cufon-canvas" alt="Encrypted " style="width: 115px; height:
24px;"><canvas width="167" height="32" style="width: 167px; height: 32px; top: -
5px; left: -16px;"></canvas><cufontext>Encrypted </cufontext></cufon><cufon
class="cufon cufon-canvas" alt="Data " style="width: 58px; height: 24px;"><canvas
width="109" height="32" style="width: 109px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>Data </cufontext></cufon><cufon class="cufon cufon-
canvas" alt="in " style="width: 26px; height: 24px;"><canvas width="77"

24
height="32" style="width: 77px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>in </cufontext></cufon><cufon class="cufon cufon-
canvas" alt="Cloud" style="width: 63px; height: 24px;"><canvas width="108"
height="32" style="width: 108px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>Cloud</cufontext></cufon></a><a
href="http://localhost:8081/Attribute_basedStorageSupport/index.html"></a></h1>
</div>
<div class="clr"></div>
<div class="menu_nav">
<ul>
<li class="active"><a
href="http://localhost:8081/Attribute_basedStorageSupport/index.html">Home</a></l
i>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/DO_Login.jsp">Data
Owner </a></li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/DU_Login.jsp">User</a>
</li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/A_Login.jsp">Authority<
/a></li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/C_Login.jsp">Cloud</a>
</li>
</ul>
</div>
<div class="clr"></div>
</div>
</div>
<div class="content">
<div class="content_resize">
<div class="mainbar">
<div class="article">

25
 <h2><span><cufon class="cufon cufon-canvas" alt="Authentication "
style="width: 216px; height: 24px;"><canvas width="268" height="32" style="width:
268px; height: 32px; top: -5px; left: -16px;"></canvas><cufontext>Authentication
</cufontext></cufon><cufon class="cufon cufon-canvas" alt="Login " style="width:
82px; height: 24px;"><canvas width="134" height="32" style="width: 134px; height:
32px; top: -5px; left: -16px;"></canvas><cufontext>Login
</cufontext></cufon></span></h2>
<p><img src="./Authority Login_files/Login.jpg" width="176"
height="138"></p>
<form
action="http://localhost:8081/Attribute_basedStorageSupport/A_Authentication.jsp"
method="post" id="leavereply">
<p class="style25"><strong>Name (required)&nbsp;
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;

<input name="userid" type="text" class="box" id="name" value="">

</strong></p>
<p><span class="style25"><strong> Password
(required</strong></span>)&nbsp;&nbsp;&nbsp;

<input type="password" id="pass" name="pass" class="box">

</p>
<p>&nbsp; </p>
<input name="imageField" type="submit" class="LOGIN"
id="imageField" value="Login">
<input type="reset" name="imageField" id="imageField"
class="RESET">
</form>
<p>&nbsp;</p>
</div>
</div>
<div class="sidebar">
<div class="gadget">

26
 <h2 class="star"><cufon class="cufon cufon-canvas" alt="Menu"
style="width: 71px; height: 24px;"><canvas width="112" height="32" style="width:
112px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>Menu</cufontext></cufon></h2>
<ul class="sb_menu">
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/DU_Login.jsp">User</a>
</li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/C_Login.jsp">Cloud</a>
</li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/A_Login.jsp">Authority<
/a></li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/DO_Login.jsp">Data
Owner</a></li>
</ul>
</div>
<div class="gadget"></div>
</div>
<div class="clr"></div>
</div>
</div>
<div class="footer">
<div class="footer_resize">
<p class="lf">&nbsp;</p>
<div class="clr"></div>
</div>
<div class="clr"></div>
</div>
</div>
<div align="center"></div>

27
</body>

</html>

Cloud Login.html

<!-- saved from

url=(0063)http://localhost:8081/Attribute_basedStorageSupport/C_Login.
jsp -->
<html xmlns="http://www.w3.org/1999/xhtml" class="cufon-active
cufon-ready">

<head>
<meta http-equiv="Content-Type" content="text/html;
charset=windows-1252">
<title>Cloud Login</title>

<link href="./Cloud Login_files/style.css" rel="stylesheet"

type="text/css">
<script type="text/javascript" src="./Cloud Login_files/cufon-
yui.js.download"></script>
<style type="text/css">
cufon {
text-indent: 0!important;
}

@media screen,
projection {
cufon {

28
 display: inline!important;
display: inline-block!important;
position: relative!important;
vertical-align: middle!important;
font-size: 1px!important;
line-height: 1px!important;
}
cufon cufontext {
display: -moz-inline-box!important;
display: inline-block!important;
width: 0!important;
height: 0!important;
overflow: hidden!important;
text-indent: -10000in!important;
}
cufon canvas {
position: relative!important;
}
}

@media print {
cufon {
padding: 0!important;
}
cufon canvas {
display: none!important;
}
}
</style>

29
 <script type="text/javascript" src="./Cloud
Login_files/arial.js.download"></script>
<script type="text/javascript" src="./Cloud
Login_files/cuf_run.js.download"></script>
<style type="text/css">
<!-- .style32 {
color: #FF0000;
font-size: 24px;
}

.style33 {
color: #FF0000
}

-->
</style>
</head>

<body>
<div class="main">
<div class="header">
<div class="header_resize">
<div class="logo">
<h1><a
href="http://localhost:8081/Attribute_basedStorageSupport/index.html"
class="style32"><cufon class="cufon cufon-canvas" alt="Attribute-Based
" style="width: 173px; height: 24px;"><canvas width="224" height="32"
style="width: 224px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>Attribute-Based

30
</cufontext></cufon><cufon class="cufon cufon-canvas" alt="Storage "
style="width: 91px; height: 24px;"><canvas width="143" height="32"
style="width: 143px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>Storage </cufontext></cufon><cufon
class="cufon cufon-canvas" alt="Supporting " style="width: 123px;
height: 24px;"><canvas width="175" height="32" style="width: 175px;
height: 32px; top: -5px; left: -16px;"></canvas><cufontext>Supporting
</cufontext></cufon><cufon class="cufon cufon-canvas" alt="Secure "
style="width: 83px; height: 24px;"><canvas width="135" height="32"
style="width: 135px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>Secure </cufontext></cufon><cufon
class="cufon cufon-canvas" alt="Deduplication " style="width: 153px;
height: 24px;"><canvas width="204" height="32" style="width: 204px;
<href="http://localhost:8081/Attribute_basedStorageSupport/index.html"
></a></h1>
</div>
<div class="clr"></div>
<div class="menu_nav">
<ul>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/index.html">
Home</a></li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/DO_Login.js
p">Data Owner </a></li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/DU_Login.js
p">User</a></li>

31
 <li><a
href="http://localhost:8081/Attribute_basedStorageSupport/A_Login.jsp"
>Authority</a></li>
<li class="active"><a
href="http://localhost:8081/Attribute_basedStorageSupport/C_Login.jsp"
>Cloud</a></li>
</ul>
</div>
<div class="clr"></div>
</div>
</div>
<div class="content">
<div class="content_resize">
<div class="mainbar">
<div class="article">
<h2><cufon class="cufon cufon-canvas" alt="Cloud "
style="width: 91px; height: 24px;"><canvas width="143" height="32"
style="width: 143px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>Cloud </cufontext></cufon><cufon
class="cufon cufon-canvas" alt="login" style="width: 75px; height:
24px;"><canvas width="116" height="32" style="width: 116px; height:
32px; top: -5px; left: -
16px;"></canvas><cufontext>login</cufontext></cufon></h2>
<p align="center"><img src="./Cloud
Login_files/CLogin.jpg" width="173" height="121"></p>
<form
action="http://localhost:8081/Attribute_basedStorageSupport/C_Authenti
cation.jsp" method="post" id="leavereply">

32
 <p class="style33"> Name
(required)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
&nbsp;&nbsp;&nbsp;&nbsp;

<input name="userid" type="text" class="box"

id="name" value="">
</p>
<p><span class="style33"> Password
(required)&nbsp;</span>&nbsp;&nbsp;

<input type="password" id="pass" name="pass"

class="box">
</p>
<input name="imageField" type="submit"
class="LOGIN" id="imageField" value="Login">
<input type="reset" name="imageField"
id="imageField" class="RESET">
</form>
<p align="justify">&nbsp;</p>
</div>
</div>
<div class="sidebar">
<div class="gadget">
<h2 class="star"><cufon class="cufon cufon-canvas"
alt="Menu" style="width: 71px; height: 24px;"><canvas width="112"
height="32" style="width: 112px; height: 32px; top: -5px; left: -
16px;"></canvas><cufontext>Menu</cufontext></cufon></h2>
<ul class="sb_menu">

33
 <li><a
href="http://localhost:8081/Attribute_basedStorageSupport/DU_Login.js
p">User</a></li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/C_Login.jsp"
>Cloud</a></li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/A_Login.jsp"
>Authority</a></li>
<li><a
href="http://localhost:8081/Attribute_basedStorageSupport/DO_Login.js
p">Data Owner </a></li>
</ul>
</div>
<div class="gadget"></div>
</div>
<div class="clr"></div>
</div>
</div>
<div class="footer">
<div class="footer_resize">
<p class="lf">&nbsp;</p>
<div class="clr"></div>
</div>
<div class="clr"></div>
</div>
</body>
</html>

34
7. SCREENSHOTS

fig 1. Domestic page

35
fig 2. Records owner registration page

36
 Fig 3. Data Owner Login

fig 4. information owner web page

37
 fig 5. Statistics proprietor including files

fig 6. Statistics proprietor viewing documents

38
fig 7. Statistics owner requesting keys

fig 8. records person viewing files

fig 9. records user downloading files

39
 fig 10. authority login

fig 11. authority web page

40
fig 12. Admin viewing documents

fig 13. cloud login page

fig 14. cloud having storage of files

41
 CONCLUSIONS
Attribute-based encryption (ABE) has been widely used in cloud computing where data
providers outsource their encrypted data to the cloud and can share the data with users
possessing specified credentials. On the other hand, deduplication is an important
technique to save the storage space and network bandwidth, which eliminates duplicate
copies of identical data. However, the standard ABE systems do not support secure
deduplication, which makes them costly to be applied in some commercial storage
services. In this paper, we presented a novel approach to realize an attribute-based storage
system supporting secure deduplication. Our storage system is built under a hybrid cloud
architecture, where a private cloud manipulates the computation and a public cloud
manages the storage.
The private cloud is provided with a trapdoor key associated with the
corresponding ciphertext, with which it can transfer the ciphertext over one access policy
into ciphertexts of the same plaintext under any other access policies without being aware
of the underlying plaintext. After receiving a storage request, the private cloud first
checks t he validity o f the uploaded item through the attached proof. If the proof is valid,
the private cloud runs a tag matching algorithm to see whether the same data underlying
the ciphertext has been stored. If so, whenever it is necessary, it regenerates the ciphertext
into a ciphertext of the same plaintext over an access policy which is the union set of both
access policies.
The proposed storage system enjoys two major advantages. Firstly, it can be used
to confidentially share data with other users by specifying an access policy rather than
sharing the decryption key. Secondly, it achieves the standard notion of semantic security
while existing deduplication schemes only achieve it under a weaker security notion.

42
 REFERENCES
[1] D. Quick, B. Martini, and K. R. Choo, Cloud Storage Forensics. Syngress
Publishing/Elsevier,2014.[Online].Available:http://www.elsevier.com/books/cloud-
storageforensics/quick/978-0-12-419970-5
[2] K. R. Choo, J. Domingo-Ferrer, and L. Zhang, “Cloud cryptography: Theory, practice
and future research directions,” Future Generation Comp. Syst., vol. 62, pp. 51–53, 2016.
[3] K. R. Choo, M. Herman, M. Iorga, and B. Martini, “Cloud forensics: State-of-the-art
and future directions,” Digital Investigation, vol. 18, pp. 77–78, 2016.
[4] Y. Yang, H. Zhu, H. Lu, J.Weng, Y. Zhang, and K. R. Choo, “Cloud based data
sharing with fine-grained proxy re-encryption,” Pervasive and Mobile Computing, vol.
28, pp. 122–134, 2016.
[5] D. Quick and K. R. Choo, “Google drive: Forensic analysis of data remnants,” J.
Network and Computer Applications, vol. 40, pp. 179– 193, 2014.
[6] A. Sahai and B. Waters, “Fuzzy identity-based encryption,” in Advances in
Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory
and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005,
Proceedings, ser. Lecture Notes in Computer Science, vol. 3494. Springer, 2005, pp. 457–
473.
[7] B. Zhu, K. Li, and R. H. Patterson, “Avoiding the disk bottleneck in the data domain
deduplication file system,” in 6th USENIX Conference on File and Storage Technologies,
FAST 2008, February 26- 29, 2008, San Jose, CA, USA. USENIX, 2008, pp. 269–282.
[8] M. Bellare, S. Keelveedhi, and T. Ristenpart, “Message-locked encryption and secure
deduplication,” in Advances in Cryptology - EUROCRYPT 2013, 32nd Annual
International Conference on the Theory and Applications of Cryptographic Techniques,
Athens, Greece, May 26-30, 2013. Proceedings, ser. Lecture Notes in Computer Science,
vol. 7881. Springer, 2013, pp. 296–312.
[9] M. Abadi, D. Boneh, I. Mironov, A. Raghunathan, and G. Segev, “Message-locked
encryption for lock-dependent messages,” in Advances in Cryptology - CRYPTO 2013 -
33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013.
Proceedings, Part I, ser. Lecture Notes in Computer Science, vol. 8042. Springer, 2013,
pp. 374–391.

43
[10] S. Keelveedhi, M. Bellare, and T. Ristenpart, “Dupless: Serveraided encryption for
deduplicated storage,” in Proceedings of the 22th USENIX Security Symposium,
Washington, DC, USA, August 14-16, 2013. USENIX Association, 2013, pp. 179–194.
[11] M. Bellare and S. Keelveedhi, “Interactive message-locked encryption and secure
deduplication,” in Public-Key Cryptography – PKC 2015 - 18th IACR International
Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD,
USA, March 30 – April 1, 2015, Proceedings, ser. Lecture Notes in Computer Science,
vol. 9020. Springer, 2015, pp. 516–538.
[12] S. Bugiel, S. N¨ urnberger, A. Sadeghi, and T. Schneider, “Twin clouds: Secure
cloud computing with low latency - (full version),” in Communications and Multimedia
Security, 12th IFIP TC 6 / TC 11 International Conference, CMS 2011, Ghent, Belgium,
October 19- 21,2011. Proceedings, ser. Lecture Notes in Computer Science, vol. 7025.
Springer, 2011, pp. 32–44.
[13] S. Goldwasser, S. Micali, and C. Rackoff, “The knowledge complexity of interactive
proof-systems (extended abstract),” in Proceedings of the 17th Annual ACM Symposium
on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA. ACM, 1985,
pp. 291– 304.
[14] M. Fischlin and R. Fischlin, “Efficient non-malleable commitment schemes,” in
Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology
Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings, ser.
Lecture Notes in Computer Science, vol. 1880. Springer, 2000, pp. 413–431.
[15] S. Goldwasser and S. Micali, “Probabilistic encryption,” J. Comput. Syst. Sci., vol.
28, no. 2, pp. 270–299, 1984.
[16] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-
grained access control of encrypted data,” in Proceedings of the 13th ACM Conference
on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, Ioctober
30 - November 3, 2006, ser. Lecture Notes in Computer Science, vol. 5126. Springer,
2006, pp. 89–98.
[17] R. Ostrovsky, A. Sahai, and B.Waters, “Attribute-based encryption with non-
monotonic access structures,” in Proceedings of the 2007 ACM Conference on Computer

44
and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31,
2007. ACM, 2007, pp. 195–203.
[18] A. B. Lewko and B. Waters, “Unbounded HIBE and attributebased encryption,” in
Advances in Cryptology - EUROCRYPT 2011 - 30th Annual International Conference on
the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15-19,
2011. Proceedings, ser. Lecture Notes in Computer Science, vol. 6632. Springer, 2011,
pp. 547–567.
[19] J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-policy attribute-based
encryption,” in 2007 IEEE Symposium on Security and Privacy (S&P 2007), 20-23 May
2007, Oakland, California, USA. IEEE Computer Society, 2007, pp. 321–334.
[20] L. Cheung and C. C. Newport, “Provably secure ciphertext policy ABE,” in
Proceedings of the 2007 ACM Conference on Computer and Communications Security,
CCS 2007, Alexandria, Virginia, USA, October 28-31, 2007. ACM, 2007, pp. 456–465.
[21] V. Goyal, A. Jain, O. Pandey, and A. Sahai, “Bounded ciphertext policy attribute
based encryption,” in Automata, Languages and Programming, 35th International
Colloquium, ICALP 2008, Reykjavik

45