M.Tech

1. VISVESVARAYA TECHNOLOGICAL UNIVERSITY
Jnana Sangama, Belgaum, Karnataka-590 014.
“ATTRIBUTE-BASED ENCRYPTION IN CLOUD WITH
SIGNIFICANT REDUCTION OF COMPUTATION TIME”
By,
Naveena N
B.T.L INSTITUTE OF TECHNOLOGY
Department of Computer Science & Engineering
2013-14
Under the Guidance of:
Mrs. R Vidhyalakshmi

2. ABSTRACT
 Cloud storage system endows users to remotely store their data and utilize the on-demand
superiority cloud applications without the burden of local hardware and
software management. While cloud computing induces these advantages more
appealing than ever, it also brings revolutionary and challenging security threats to the
outsourced data.
 To ensure the data security and integrity in cloud storage, until now, a large number of
techniques have been proposed to handle this problem, but all of them have possess
their own inherent limitations.
 In this project, give the formal model of Ciphertext-policy Attribute Based Encryption
(CP-ABE) algorithm with a hierarchical structure to improve scalability and flexibility.
This effectively eliminates the need to rely on the data storage server for preventing
unauthorized data access and integrity. The performance measurements indicate that the
proposed scheme is efficient to securely manage the data stored in the data storage
servers and significantly reduces the computation time.

3. LITERATURE SURVEY
 Yu et al, [8] “Achieving Secure, Scalable and Fine-Grained Data Access Control
in Cloud Computing,” and [14] “Attribute Based Data Sharing With Attribute
Revocation,” applied key-policy ABE to secure outsourced data in the cloud. In this
scheme, a single data owner can encrypt data and share with multiple authorized users,
. The main disadvantage in the scheme is that the data owner is also a Trusted
Authority (TA) at the same time. It would be inefficient because each user would
receive many keys from multiple owners.
 V. Goyal, and V. Kumar, [12] “Identity-Based Encryption With Efficient
Revocation,” Traditionally this is often done by the authority broadcasting periodic
key updates to unrevoked users frequently but does not achieve complete backward/
forward security and is less efficient.

4. EXISTING SYSTEM
o One of the main efficiency drawbacks of the most existing ABE schemes is
that decryption is expensive for resource-limited devices due to pairing
operations, and the number of pairing operations required to decrypt a
ciphertext grows with the complexity of the access policy.
 Fine grained access control not possible.

5. PROPOSED SYSTEM
 Propose a new CP-ABE model, based on this project model construct a
concrete ABE scheme with verifiable outsourced decryption. Proposed
scheme does not rely on random oracles.

6. ADVANTAGES
 This effectively eliminates the need to rely on the data storage server for
preventing unauthorized data access and provides integrity.
 The scheme substantially reduced the computation time required for
resource-limited devices to recover plaintexts.

7. SYSTEM MODEL
• System Architecture

8. MODULES
• System Setup Module.
• New User Grant Module.
• File Upload Module.
• File Access Module.
• User Revocation Module.
• Performance measurements.
• Deploy to cloud provider.

9. MODULES
• System Setup Module.
• New User Grant Module.
• File Upload Module.
• File Access Module.
• User Revocation Module.
• Performance measurements.
• Deploy to cloud provider.

10. ACTIVITIVITY DIAGRAM

11. RESULTS AND DISCUSSION

12. RESULTS AND DISCUSSION

13. RESULTS AND DISCUSSION

14. RESULTS AND DISCUSSION

15. RESULTS AND DISCUSSION

16. RESULTS AND DISCUSSION

17. CONCLUSION
 In this project focused on Ciphertext-policy Attribute Based Encryption (CP-ABE)
algorithm with a hierarchical structure to improve scalability and
flexibility. This effectively eliminates the need to rely on the data storage server
for preventing unauthorized data access and integrity. The performance
measurements indicate that the proposed scheme is efficient to securely manage
the data stored in the data storage servers and significantly reduces the
computation time.

18. THANK YOU