ABSTRACT
Cloud
storage auditing is viewed as an important service to verify the integrity of
the data in public cloud. Current auditing protocols are all based on the
assumption that the client’s secret key for auditing is absolutely secure.
However, such assumption may not always be held, due to the possibly weak sense
of security and/or low security settings at the client. If such a secret key
for auditing is exposed, most of the current auditing protocols would
inevitably become unable to work. In this paper, we focus on this new aspect of
cloud storage auditing. We investigate how to reduce the damage of the client’s
key exposure in cloud storage auditing, and give the first practical solution for
this new problem setting. We formalize the definition and the security model of
auditing protocol with key-exposure resilience and propose such a protocol. In
our design, we employ the binary tree structure and the pre-order traversal
technique to update the secret keys for the client. We also develop a novel
authenticator construction to support the forward security and the property of
block less verifiability. The security proof and
the performance analysis show that our proposed protocol is secure and
efficient.
AIM
The
aim of this paper is to investigate
how to reduce the damage of the client’s key exposure in cloud storage auditing.
SCOPE
The scope of this paper tends to formalize the definition and
the security model of auditing protocol with key-exposure resilience and
propose such a protocol
EXISTING
SYSTEM
In
recent years, auditing protocols for cloud storage have attracted much
attention and have been researched intensively. These protocols focus on
several different aspects of auditing, and how to achieve high bandwidth and
computation efficiency is one of the essential concerns.
DISADVANTAGES:
- Such assumption may not always be held, due to the possibly weak sense of security and/or low security settings at the client
- If such a secret key for auditing is exposed, most of the current auditing protocols would inevitably become unable to work
PROPOSED SYSTEM
In
this paper, we focus on how to reduce the damage of the client key exposure in
cloud storage auditing. Our goal is to design a cloud storage auditing protocol
with built-in key-exposure resilience. How to do it efficiently under this new
problem setting brings in many new challenges to be addressed below. First of
all, applying the traditional solution of key revocation to cloud storage
auditing is not practical. This is because, whenever the client’s secret key
for auditing is exposed, the client needs to produce a new pair of public key
and secret key and regenerate the authenticators for the client’s data
previously stored in cloud. The process involves the downloading of whole data
from the cloud, producing new authenticators, and re-uploading everything back
to the cloud, all of which can be tedious and cumbersome. Besides, it cannot
always guarantee that the cloud provides real data when the client regenerates
new authenticators. Secondly, directly adopting standard key-evolving technique
is also not suitable for the new problem setting. It can lead to retrieving all
of the actual files blocks when the verification is proceed.
ADVANTAGES:
- Develop a novel authenticator construction to support the forward security and the property of block less verifiability
- The security proof and the performance analysis show that our proposed protocol is secure and efficient.
SYSTEM
ARCHITECTURE
SYSTEM CONFIGURATION
Hardware Requirements
- Speed - 1.1 Ghz
- Processor - Pentium IV
- RAM - 512 MB (min)
- Hard Disk - 40 GB
- Key Board - Standard Windows Keyboard
- Mouse - Two or Three Button Mouse
- Monitor - LCD/LED
Software
requirements
- Operating System : Windows 7
- Front End : ASP.Net and C#
- Database : MSSQL
- Tool : Microsoft Visual studio
REFERENCES
Talal
H. Noor, Quan
Z. Sheng , Lina
Yao ,“ Enabling
Cloud Storage Auditing With Key-Exposure Resistance,” IEEE Transactions On
Information Forensics And Security, VOL 10,ISS 6, FEBRUARY 2015.
No comments:
Post a Comment