KEY-AGGREGATE
CRYPTOSYSTEM FOR SCALABLE DATA SHARING IN CLOUD STORAGE
ABSTRACT:
Data sharing is an
important functionality in cloud storage. In this article, we show how to securely,
efficiently, and flexibly share data with others in cloud storage. We
describe new public-key cryptosystems which produce constant-size
ciphertexts such that efficient delegation of decryption rights for any set of
ciphertexts are possible. The novelty is that one can aggregate any set of
secret keys and make them as compact as a single key, but encompassing the
power of all the keys being aggregated. In other words, the secret key holder
can release a constant-size aggregate key for flexible choices of ciphertext
set in cloud storage, but the other encrypted files outside the set remain confidential.
This compact aggregate key can be conveniently sent to others or be stored in a
smart card with very limited secure storage. We provide formal security
analysis of our schemes in the standard model. We also describe other application
of our schemes. In particular, our schemes give the first public-key
patient-controlled encryption for flexible hierarchy, which was yet to be
known.
EXISTING SYSTEM:
Considering data privacy,
a traditional way to ensure it is to rely on the server to enforce the access control
after authentication, which means any unexpected privilege escalation will
expose all data. In a shared-tenancy cloud computing environment, things become
even worse. Data from different clients can be hosted on separate virtual
machines (VMs) but reside on a single physical machine. Data in a target VM
could be stolen by instantiating another VM co-resident with the target one.
Regarding availability of files, there are a series of cryptographic schemes
which go as far as allowing a third-party auditor to check the availability of
files on behalf of the data owner without leaking anything about the data, or
without compromising the data owner’s anonymity. Likewise, cloud users probably
will not hold the strong belief that the cloud server is doing a good job in
terms of confidentiality. A cryptographic solution, with proven security relied
on number-theoretic assumptions is more desirable, whenever the user is not
perfectly happy with trusting the security of the VM or the honesty of the
technical staff. These users are motivated to encrypt their data with their own
keys before uploading them to the server.
DISADVANTAGES OF
EXISTING SYSTEM:
· Unexpected
privilege escalation will expose all
· It is not efficient.
· Shared data will not be secure.
PROPOSED SYSTEM:
The best solution for the above problem is that
Alice encrypts files with distinct public-keys, but only sends Bob a single
(constant-size) decryption key. Since the decryption key should be sent via a
secure channel and kept secret, small key size is always desirable. For
example, we cannot expect large storage for decryption keys in the
resource-constraint devices like smart phones, smart cards or wireless sensor
nodes. Especially, these secret keys are usually stored in the tamper-proof
memory, which is relatively expensive. The present research efforts mainly
focus on minimizing the communication requirements (such as bandwidth, rounds
of communication) like aggregate signature. However, not much has been done
about the key itself.
ADVANTAGES OF PROPOSED
SYSTEM:
·
It is more secure.
·
Decryption key should be sent via a
secure channel and kept secret.
· It is an efficient public-key encryption scheme
which supports flexible delegation.
SYSTEM
ARCHITECTURE:
SYSTEM CONFIGURATION:-
HARDWARE REQUIREMENTS:-
ü Processor - Pentium
–IV
ü Speed - 1.1 Ghz
ü 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 XP
•
Coding Language : Java
•
Data Base : MySQL
•
Tool : Net Beans IDE
REFERENCE:
Cheng-Kang Chu, Sherman S. M. Chow, Wen-Guey Tzeng,
Jianying Zhou, and
Robert H. Deng, “Key-Aggregate Cryptosystem for
Scalable Data Sharing in Cloud Storage”
IEEE
TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, Vol: 25, Issue: 2, Feb.
2014.
No comments:
Post a Comment