An efficient file hierarchy attribute based

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing
ABSTRACT:
Ciphertext-policy attribute-based encryption (CP-ABE) has been a preferred encryption
technology to solve the challenging problem of secure data sharing in cloud computing. The
shared data files generally have the characteristic of multilevel hierarchy, particularly in the area
of healthcare and the military. However, the hierarchy structure of shared files has not been
explored in CP-ABE. In this paper, an efficient file hierarchy attribute-based encryption scheme
is proposed in cloud computing. The layered access structures are integrated into a single access
structure, and then, the hierarchical files are encrypted with the integrated access structure. The
ciphertext components related to attributes could be shared by the files. Therefore, both
ciphertext storage and time cost of encryption are saved. Moreover, the proposed scheme is
proved to be secure under the standard assumption. Experimental simulation shows that the
proposed scheme is highly efficient in terms of encryption and decryption. With the number of
the files increasing, the advantages of our scheme become more and more conspicuous.
EXISTING SYSTEM:
Sahai and Waters proposed fuzzy Identity-Based Encryption (IBE) in 2005, which was the
prototype of ABE. Latterly, a variant of ABE named CP-ABE was proposed.Since Gentry and
Silverberg proposed the first notion of hierarchical encryption scheme, many hierarchical CP-
ABE schemes have been proposed. For example, Wang et al. proposed a hierarchical ABE
scheme by combining the hierarchical IBE and CP-ABE.Wan et al. proposed hierarchical ABE
scheme. Later, Zou gave a hierarchical ABE scheme, while the length of secret key is linear with
the order of the attribute set. A ciphertextpolicy hierarchical ABE scheme with short ciphertext is
also studied.In these schemes, the parent authorization domain governs its child authorization
domains and a top-level authorization domain creates secret key of the next-level domain. The
work of key creation is distributed on multiple authorization domains and the burden of key
authority center is lightened.

DISADVANTAGES OF EXISTING SYSTEM:
In Existing System time and cost for encryption is high.
No any special multiple hierarchical files are used.
Decryption system time and computation cost are very high.
PROPOSED SYSTEM:
In this study, an efficient encryption scheme based on layered model of the access structure is
proposed in cloud computing, which is named file hierarchy CP-ABE scheme (or FH-CP-ABE,
for short). FH-CP-ABE extends typical CP-ABE with a hierarchical structure of access policy, so
as to achieve simple, flexible and fine-grained access control.The contributions of our scheme
are three aspects.Firstly, we propose the layered model of access structure to solve the problem
of multiple hierarchical files sharing. The files are encrypted with one integrated access
structure. Secondly, we also formally prove the security of FH-CP-ABE scheme that can
successfully resist chosen plaintext attacks (CPA) under the Decisional Bilinear Diffie-Hellman
(DBDH) assumption. Thirdly, we conduct and implement comprehensive experiment for FH-CP-
ABE scheme, and the simulation results show that FH-CP-ABE has low storage cost and
computation complexity in terms of encryption and decryption.
ADVANTAGES OF PROPOSED SYSTEM:
CP-ABE feasible schemes which has much more flexibility and is more suitable for general
applicationsMultiple hierarchical files sharing are resolved using layered model of access
structure.In proposed system both ciphertext storage and time cost of encryption are saved.The
proposed scheme has an advantage that users can decrypt all authorization files by computing
secret key once. Thus, the time cost of decryption is also saved if the user needs to decrypt
multiple files.The computation cost of decryption can also be reduced if users need to decrypt
multiple files at the same time.

SYSTEM ARCHITECTURE:
Algorithm:
The FH-CP-ABE scheme consists of below operations:
1) (PK, MSK) ← Setup(1κ):
The probabilistic operation takes a security parameter κ as input and outputs public key PK and
master secret key MSK.
2) (SK) ← KeyGen(P K, M SK, S):
The operation inputs PK, MSK and a set of attributes S and creates a secret key SK.
3) File Encrypted Data ← FileEncrypt(FileData m, ContentKey ck):
The operation inputs File Data m and Content Key ck and using of content key ck we can
encrypt the file data and store in cloud.
4) (CT) ← Encrypt (PK, ck, A):

The operation inputs PK, ck = {ck1... ckk} and a hierarchical access tree A. At last, it creates an
integrated ciphertext of content keys CT.
5) (cki(i ∈ [1, k])) ← Decrypt(P K, CT, SK):
The algorithm inputs PK, CT which includes an integrated access structure A, SK described by a
set of attributes S. If the S matches part of A, some content keys cki(i ∈ [1, k]) can be decrypted.
If it matches the whole A, all the content keys can be decrypted. Then, the corresponding files
mi(i ∈ [1, k]) will be decrypted with the content keys by the symmetric decryption algorithm.
About Cloud Technologies:
Cloud Technologies is one of the best software development company. Which is providing
IEEE, real time projects and training for M-Tech, B-Tech, ME, BE, BCA, MCA students
and freshers in Hyderabad Ameerpet. Our aim is to ensure you receive the best commanding on
subject.

SYSTEM CONFIGURATION:
Hardware requirements:
Processer : Any Update Processer
Ram : Min 1 GB
Hard Disk : Min 100 GB
Software requirements:
Operating System : Windows family
Technology : Java (1.7/1.8)
Web Technologies : Html, Html-5, JavaScript, CSS.
Web Server : Tomcat 7/8
Server side Lang : J2EE
Database : My SQL5.5

An efficient file hierarchy attribute based

Recommended

More Related Content

What's hot (20)

Similar to An efficient file hierarchy attribute based (20)

Recently uploaded (20)

An efficient file hierarchy attribute based