SEPDP: Secure and Efficient Privacy Preserving Provable Data Possession in Cloud Storage

IEEE BASE PAPER ABSTRACT:

Cloud computing is an emergent paradigm to provide reliable and resilient infrastructure enabling the users (data owners) to store their data and the data consumers (users) can access the data from cloud servers. This paradigm reduces storage and maintenance cost of the data owner. At the same time, the data owner loses the physical control and possession of data which leads to many security risks. Therefore, auditing service to check data integrity in the cloud is essential. This issue has become a challenge as the possession of data needs to be verified while maintaining the privacy. To address these issues this work proposes a secure and efficient privacy preserving provable data possession (SEPDP). Further, we extend SEPDP to support multiple owners, data dynamics and batch verification. The most attractive feature of this scheme is that the auditor can verify the possession of data with low computational overhead.

PROJECT OUTPUT VIDEO:

EXISTING SYSTEM:

PDP is introduced that uses random sampling of a few blocks for integrity verification.
Shacham et al. designed two different integrity verification mechanisms. One uses pseudo-random function (PRF) which fails to provide public verifiability, while the other one uses boneh–lynn–shacham (BLS) signatures.
Both the schemes support blockless verification but fail to provide privacy of the DO’s data. Blockless verification requires linear combination of sampled blocks which gives a clue to TPA to extract the data.
To preserve privacy of the data owner supporting blockless verification, Wang et al. proposed a public auditing scheme and extended that to support batch auditing further.

DISADVANTAGES OF EXISTING SYSTEM:

Do not achieve privacy preserving requirement.
Could not achieve batch auditing requirement which ensures that TPA should be capable enough to deal with the multiple numbers of simultaneous verification requests from different DUs
Use pairing based cryptographic operations which are intensive computation and need more time.

PROPOSED SYSTEM:

In this work, we propose a secure and efficient privacy preserving provable data possession scheme (SEPDP) for cloud storage. It operates in three phases, namely, key generation, signature generation and auditing phase.
We extend SEPDP to support multiple data owners, batch auditing, and dynamic data operations. A probabilistic analysis to detect the integrity of the blocks stored at CSP.
We evaluated the performance of the proposed scheme and compared with some of the existing popular mechanisms.
We observe that the total time for verification carried out by TPA in the proposed scheme is less than that of the existing schemes. This signifies that SEPDP is efficient and suitable to implement the verification at the low powered devices.

ADVANTAGES OF PROPOSED SYSTEM:

Guarantee for Storage Correctness
Guarantee for Privacy Preserving
Blockless Verification
Public Auditability
Guarantee for Unforgeability
Batch Auditing
Data Dynamics

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

System : Pentium Dual Core.

Hard Disk : 120 GB.

Monitor : 15’’ LED

Input Devices : Keyboard, Mouse

Ram : 1 GB

SOFTWARE REQUIREMENTS:

Operating System : Windows 10 / 11.
Coding Language : JAVA.
Frontend : JSP, HTML, CSS, JavaScript.
IDE Tool : NetBeans IDE 8.2.
Database : MYSQL.

REFERENCE:

Sanjeet Kumar Nayak, Student Member, IEEE, and Somanath Tripathy, Senior Member, IEEE, “SEPDP: Secure and Efficient Privacy Preserving Provable Data Possession in Cloud Storage”, IEEE Transactions on Services Computing, 2021.

java ieee projects

SEPDP: Secure and Efficient Privacy Preserving Provable Data Possession in Cloud Storage