Scribd
Upload
10 views

Dynamic-Hash-Table Based Public Auditing

nice

Uploaded by

Anonymous buSPtQ8F0u
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
10 views

Dynamic-Hash-Table Based Public Auditing

nice

Uploaded by

Anonymous buSPtQ8F0u
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/ 7

Dynamic-Hash-Table Based Public Auditing for Secure

Cloud Storage
ABSTRACT:

Cloud storage is an increasingly popular application of cloud computing, which


can provide on-demand outsourcing data services for both organizations and
individuals. However, users may not fully trust the cloud service providers (CSPs)
in that it is difficult to determine whether the CSPs meet their legal expectations
for data security. Therefore, it is critical to develop efficient auditing techniques to
strengthen data owners' trust and confidence in cloud storage. In this paper, we
present a novel public auditing scheme for secure cloud storage based on dynamic
hash table (DHT), which is a new two-dimensional data structure located at a third
parity auditor (TPA) to record the data property information for dynamic auditing.
Differing from the existing works, the proposed scheme migrates the authorized
information from the CSP to the TPA, and thereby significantly reduces the
computational cost and communication overhead. Meanwhile, exploiting the
structural advantages of the DHT, our scheme can also achieve higher updating
efficiency than the state-of-the-art schemes. In addition, we extend our scheme to
support privacy preservation by combining the homomorphic authenticator based
on the public key with the random masking generated by the TPA, and achieve
batch auditing by employing the aggregate BLS signature technique. We formally
prove the security of the proposed scheme, and evaluate the auditing performance
by detailed experiments and comparisons with the existing ones. The results
demonstrate that the proposed scheme can effectively achieve secure auditing for
cloud storage, and outperforms the previous schemes in computation complexity,
storage costs and communication overhead.

EXISTING SYSTEM:

 Erway et al. first presented a dynamic provable data possession (DPDP)


scheme, which extends the original PDP model by introducing a rank‐based
authenticated skip list.
 Wang et al. presented a public auditing scheme based on Merkle Hash Tree
(MHT), which can achieve the above auditing requirements.
 Zhu et al. proposed another public auditing scheme (IHT‐PA) based on an
index‐hash table (IHT), which can effectively reduce both the computational
costs and communication overhead by storing the data properties for
auditing using the IHT in the TPA instead of the CSP.

DISADVANTAGES OF EXISTING SYSTEM:

 It is critical and significant to develop efficient auditing techniques to


strengthen data ownersʹ trust and confidence in cloud storage, of which the
core is how to effectively check data integrity remotely.
 The existing schemes would incur heavy computational costs of the TPA
and large communication overhead during the updating and verification
processes.
 The IHT is the key of IHT‐PA to support data dynamics, but it is inefficient
in updating operations, especially insertion and deletion operations.
 The existing systems would induce extra computational costs to the user and
unnecessary communication overhead.

PROPOSED SYSTEM:

 This paper presents a public auditing scheme (DHT‐PA) using a new data
structure called dynamic hash table (DHT). Exploiting the DHT, our scheme
can achieve dynamic auditing.
 Moreover, because DHT‐PA migrates the authorized information from the
CSP to the TPA, its computational costs and communication overhead are
significantly smaller than the scheme based on skip list and the one based on
MHT.
 DHT‐PA also outperforms IHTPA in updating, as the times of updating
operations on the DHT are much fewer than that on the IHT.
 In addition, we extend DHT‐PA to achieve privacy preserving by combining
the homomorphic authenticator based on the public key with random
masking generated by the TPA.
 Furthermore, we employ the well‐known BLS (Boneh‐Lynn‐Shacham)
signature and bilinear maps to achieve batch auditing.

ADVANTAGES OF PROPOSED SYSTEM:

 We present a novel public auditing scheme, which can completely support


three vital functions, i.e., dynamic data auditing, privacy protection and
batch auditing.
 We design a new data structure named DHT to record data properties for
auditing in the TPA, and by virtue of it, achieve rapid auditing and efficient
data updating.
 We formally prove the security of the proposed scheme, and evaluate its
auditing performance by concrete experiments and comparisons with the
state‐of‐the‐art schemes.
 The results demonstrate that the proposed scheme can effectively achieve
secure auditing in clouds, and outperforms the previous ones in computation
complexity, storage costs and communication overhead.

SYSTEM ARCHITECTURE:

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 : ASP.NET,C#.NET
 Tool : Visual Studio 2008
 Database : SQL SERVER 2005
REFERENCE:

Hui Tian, Member, IEEE, Yuxiang Chen, Chin-Chen Chang, Fellow, IEEE, Hong
Jiang, Fellow, IEEE, Yongfeng Huang, Senior Member, IEEE, Yonghong Chen,
Member, IEEE, Jin Liu, Member, IEEE, “Dynamic-Hash-Table Based Public
Auditing for Secure Cloud Storage”, IEEE Transactions on Services
Computing, 2016.

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