Scribd
Upload
36 views29 pages

Final Review

Uploaded by

csindirareddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views29 pages

Final Review

Uploaded by

csindirareddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 29

SRI SRI VENKATESWARA INSTITUTE OF SCIENCE

AND TECHNOLOGY

Dynamic Group-Oriented
Oriented Provable Data Possession in
Cloud

sented by Guided by
0BG1A0514-C.Indira(TL)
C.Indira(TL) J.KalyaniMCA
7BG1A0523-M.Supriya
M.Supriya Assistant Professor,DEPT of CSE
0BG1A0513-C.Sai Kumari
0BG1A0553-S.Nikitha
0BG1A0504-B.Naga Jyothi
0BG1A0535-L.Anusha
CONTENTS
1.Purpose
2.Abstract
3.Existing System
4.Dis Advantages
5.Proposed System
6.Algorithms
7.Advantages
8.H/W & Software Requirement
9.Modules
10.Design
11.Output Screens
12.Testing
13.Conclusion
Purpose

This application is providing a public auditing scheme for shared data that
supports fully dynamic operations and achieves constant storage cost for the
verifiers.
 What is cloud computing?
 Cloud computing is on-demand access, via the internet, to computing resources
applications, servers (physical servers and virtual servers), data storage, development too
networking capabilities, and more—hosted
hosted at a remote data center managed by a clou
services provider (or CSP).
 what is provable data possession in cloud?
 Provable data possession (PDP) is a way to give the tenants a means to verify that the
data, stored at untrusted storage is intact and has not been tampered with, witho
requiring the tenant to download the actual data.
 What is dynamic group- oriented provable data possession in cloud?
 where a group of users work on shared files collaboratively and any group member c
update the data by modification, insertion, and deletion operations.
Abstract

As an important security property of cloud storage, data integrity has not


been sufficiently studied under the multi writer model, where a group of
users work on shared files collaboratively and any group member can update
the data by modification, insertion, and deletion operations. Existing works
under such multi-writer model would bring large storage cost to the third-
party verifiers. Furthermore, to the best of our knowledge, none of the
existing works for shared files supports fully dynamic operations, which
implies that users cannot freely perform the update operations.
we propose the first public auditing scheme for shared data that supports
fully dynamic operations and achieves constant storage cost for the verifiers.
Our scheme, named prays, is boosted by a new paradigm for remote data
integrity checking. To implement the new paradigm, we proposed a specially
designed authenticated structure, called blockless Merkle tree, and a novel
cryptographic primitive, called permission-based
permission signature.
EXISTING SYSTEM:
 Single-Writer Solutions. Integrity checking in the cloud was first explore
under the single-writer model for personal data management. Juels an
Kaliski introduced the concept of Proof of Retrievability (PoR) and propose
a concrete construction. Unfortunately, their scheme only allows limite
times of integrity checking.
 Ateniese et al. independently introduced a similar concept, called Provab
Data Possession (PDP) . Their scheme allows unlimited times of integri
checking, and supports public auditing, which means anyone can check th
data integrity.
DISADVANTAGES OF EXISTING
SYSTEM:
 1. The system was not implemented blockless Merkle tree which leads less
security on outsourced data.
 2. The system is less security due to lack of Identity-Based Encryption.
 3. It doesn’t support dynamic operations
PROPOSED SYSTEM:
Our main contributions are summarized as follows.
1) The system presents a customized authenticated structure, named blockles
Merkle tree. Compared with the traditional Merkle tree, the proposed structur
supports blockless verification (i.e., to check remote data integrity withou
downloading the challenged data blocks) through an elaborate process for eac
data block.
2) The system proposes a novel cryptographic primitive, named permission
based signature. Permission-based signature is the first cryptographic primitiv
that achieves both anonymity and offline traceability.
3) The system designs prays based on the blockless Merkle tree and th
permission-based signature. To the best of our knowledge, PRAYS is the firs
provable data possession scheme under the multi-writer model that support
fully dynamic operations as well as constant auditing metadata.
Algorithms
 These algorithms and techniques are all vital components in the realm of data security
and integrity assurance, especially in scenarios where data is stored and processed
remotely, such as in cloud computing environments.
 Merkle Hash Trees:: These are fundamental for ensuring data integrity in distributed
systems. By constructing a tree of hash values, a concise representation of the entire
dataset is created, allowing for efficient verification of data integrity. Any alteration in
the data will result in a mismatch at some level of the tree, indicating tampering.
 RSA Signature:: RSA signatures play a crucial role in data authentication and non-
non
repudiation. They provide a means for entities to digitally sign data, thereby asserting
its authenticity and ensuring that the signer cannot deny their involvement. Verification
of the signature confirms both the integrity and the origin of the data.
 Homomorphic Hash Functions:: These functions enable operations to be performed on
encrypted data without the need for decryption, thereby preserving the confidentiality
of the data during processing. This capability is particularly valuable in scenarios where
sensitive data must be analyzed or manipulated without exposing it to potential
adversaries.
 Proofs of Retrievability (POR) Techniques:: POR techniques are employed to ensure
that data stored remotely can be reliably retrieved when needed. By engaging in
challenges and responses with the cloud provider, these techniques enable clients to
verify that their data is intact and accessible, thus bolstering confidence in the
reliability of cloud storage solutions.
ADVANTAGES OF PROPOSED SYSTEM

It supports Fully dynamic operations


It supports Constant auditing metadata scheme
Secure user revocation
Anonymity Traceability
HARDWARE REQUIREMENTS:

 Processor : PentiumDualCore/Above.
 Hard Disk : 120 GB(Min).
 Ram : 4GB.
SOFTWARE REQUIREMENTS:
 Operating system : Windows .
 Coding Language : JAVA
 Front End : HTML, CSS and Java Script
 Database : MYSQL
 Web Server : Tomcat7.x
Modules
 DATA OWNER
 Data owner has to register to cloud and logs in
 Encrypts and uploads a file to cloud server Upload File with Blocks
 View All Upload File with Blocks
 Perform Data Integrity Auditing
 View Transactions.
 CLOUD SERVER
 Authorize both the owner and the user
 View All File's Blocks
 View All Transactions
 View All Attackers
 View Time Delay Results
 View Throughput Results
 TPA
 Login
 View Metadata Details
 View All Transactions
 View All Attackers
 DATA USER
 user has to register to cloud and log in
 Search Data
 Download Data.
 Group Manager
 Group Manager has to Login
 View and Authorize Users
 View and Authorize Owners
 Manage the groups between users and data owners.
Use Case Diagram
Sequence Diagram
Class Diagram
Home Page
Cloud Main
Data Owner Main
Group Manager Main
Upload File
Verify Data
User Main
TPA Main
Testing
1. Unit Testing
2. Black Box Testing
3. White Box Testing
4. Integrating Testing
5. System Testing
6. Acceptance Testing
Conclusion

In this paper, we proposed a privacy-preserving


preserving auditing scheme for dynamic shared data,
named prays. It is the first group-oriented provable data possession scheme that supports fully
dynamic operations as well as constant auditing metadata to our knowledge. The proposed
scheme is boosted by a new two-step paradigm designed for group-oriented integrity checking. In
order to realize this paradigm, we presented a block less Merkle tree for the first step, and
presented a permission-based signature for the second step. With these two tools, prays provides
all the essential features in the multi writer storage services, including fully dynamic operations,
constant auditing metadata, secure user revocation, anonymity, and traceability. In our future
work, we will extend prays from the following aspects.
aspects 1) Reducing the storage cost on the user
side to O(1) as mentioned in Section V-A. 2) Optimizing the computation cost in the revocation
phase. Unlike the traditional paradigm whose lower bound of the computation cost in the
revocation phase is O(R), it is possible to improve prays by enhancing PBS.
Thanking You

You might also like