Scribd
Upload
103 views5 pages

Deduplicatable Dynamic Proof of Storage For Multi-User Environments

This document proposes a scheme called DeyPoS that enables dynamic proof of storage and secure cross-user deduplication in multi-user cloud environments. Existing dynamic proofs of storage cannot support this feature. DeyPoS introduces a new concept called "deduplicatable dynamic proof of storage" and exploits a novel data structure called Homomorphic Authenticated Tree (HAT) to address challenges like structure diversity and private tag generation. It is the first practical construction for deduplicatable dynamic proof of storage and is proven secure while experiments show it is efficient, especially for large files and number of challenged blocks.

Uploaded by

Sahruday Tumoju
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
103 views5 pages

Deduplicatable Dynamic Proof of Storage For Multi-User Environments

This document proposes a scheme called DeyPoS that enables dynamic proof of storage and secure cross-user deduplication in multi-user cloud environments. Existing dynamic proofs of storage cannot support this feature. DeyPoS introduces a new concept called "deduplicatable dynamic proof of storage" and exploits a novel data structure called Homomorphic Authenticated Tree (HAT) to address challenges like structure diversity and private tag generation. It is the first practical construction for deduplicatable dynamic proof of storage and is proven secure while experiments show it is efficient, especially for large files and number of challenged blocks.

Uploaded by

Sahruday Tumoju
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Deduplicatable Dynamic Proof of Storage for Multi-User

Environments

ABSTRACT:

Dynamic Proof of Storage (PoS) is a useful cryptographic primitive that enables a


user to check the integrity of outsourced files and to efficiently update the files in a
cloud server. Although researchers have proposed many dynamic POS schemes in
single user environments, the problem in multi-user environments has not been
investigated sufficiently. A practical multi-user cloud storage system needs the
secure client-side cross-user deduplication technique, which allows a user to skip
the uploading process and obtain the ownership of the files immediately, when
other owners of the same files have uploaded them to the cloud server. To the best
of our knowledge, none of the existing dynamic PoSs can support this technique.
In this paper, we introduce the concept of deduplicatable dynamic proof of storage
and propose an efficient construction called DeyPoS, to achieve dynamic PoS and
secure cross-user deduplication, simultaneously. Considering the challenges of
structure diversity and private tag generation, we exploit a novel tool called
Homomorphic Authenticated Tree (HAT) .We prove the security of our
construction, and the theoretical analysis and experimental results show that our
construction is efficient in practice.

EXISTING SYSTEM:

 In most of the existing dynamic PoSs, a tag used for integrity verification is
generated by the secret key of the uploader. Thus, other owners who have the
ownership of the file but have not uploaded it due to the cross-user deduplication
on the client-side, cannot generate a new tag when they update the file. In this
situation, the dynamic PoSs would fail.
 The concept of proof of ownership which is a solution of cross-user deduplication
on the client-side was introduced. It requires that the user can generate the Merkle
tree without the help from the cloud server, which is a big challenge in dynamic
PoS.
 Another proof of ownership scheme which improves the efficiency was proposed
 A client-side deduplication scheme for encrypted data, but the scheme employs a
deterministic proof algorithm which indicates that every file has a deterministic
short proof. Thus, anyone who obtains this proof can pass the verification without
possessing the file locally.
ADVANTAGES OF PROPOSED SYSTEM:

 It is an efficient authenticated structure.


 Existing dynamic PoSs cannot be extended to the multi-user environment.
It is the first practical deduplicatable dynamic PoS scheme called DeyPoS and
proved its security in the random oracle model.
 The theoretical and experimental results show that our DeyPoS implementation is
efficient,
 Performs better especially when the file size and the number of the challenged
blocks are large.

DISADVANTAGES OF EXISTING SYSTEM:

 Existing dynamic PoSs cannot be extended to the multi-user environment.


 All existing techniques for cross-user deduplication on the client-side were
designed for static files. Once the files are updated, the cloud server has to
regenerate the complete authenticated structures for these files, which causes heavy
computation cost on the server-side.
 Due to the problem of structure diversity and private tag generation, existing
system cannot be extended to dynamic PoS.
 Unfortunately, these schemes cannot support deduplication due to structure
diversity and private tag generation.

PROPOSED SYSTEM:

 To the best of our knowledge, this is the first work to introduce a primitive called
deduplicatable dynamic Proof of Storage (deduplicatable dynamic PoS), which
solves the structure diversity and private tag generation challenges.
 We propose and implement the first efficient construction of deduplicatable
dynamic PoS called Dey-PoS, which supports unlimited number of verification and
update operations. The security of this construction is proved in the random oracle
model, and the performance is analyzed theoretically and experimentally.
In contrast to the existing authenticated structures, such as skip list and Merkle

tree, we design a novel authenticated structure called Homomorphic Authenticated

Tree (HAT), to reduce the communication cost in both the proof of storage phase

and the deduplication phase with similar computation cost.


SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

System : Pentium Dual Core.


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

Operating system : Windows 7.


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

CONCLUSION:

We proposed the comprehensive requirements in multi-user

cloud storage systems and introduced the model of

deduplicatable dynamic PoS. We designed a novel tool called

HAT which is an efficient authenticated structure. Based on

HAT, we proposed the first practical deduplicatable dynamic


PoS scheme called DeyPoS and proved its security in the

random oracle model. The theoretical and experimental results

show that our DeyPoS implementation is efficient, especially

when the file size and the number of the challenged blocks are

large.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy