Provable data possession (PDP) and proofs of retrievability (POR) of current big user data: Cryptographic schemes in cloud storage

Walker, Ieuan

doi:10.25401/cardiffmet.17104619.v1

Cryptographic schemes.pdf (1.22 MB)

Provable data possession (PDP) and proofs of retrievability (POR) of current big user data: Cryptographic schemes in cloud storage

thesis

posted on 2022-10-28, 13:19 authored by Ieuan Walker

MPhil Thesis

Background: A growing trend over the last few years is storage outsourcing. Where the concept of third-party data warehousing has become more popular. This trend prompts serval interesting security issues. One of the biggest issues with third-party data providers is accountability. This thesis, reviews two schemas/ algorithms that allows users to check the integrity and availability of their outsourced data on untrusted data stores. The reviewed schemas are Provable Data Possession (PDP) and Proofs of Retrievability (POR). Both are cryptographic protocols designed to give clients the assurance needed that their data is secure on the untrusted file storage. Furthermore, a conceptual framework is proposed to mitigate the weaknesses of the current storage solutions.

Results: PDP and POR schemas do have different responsibilities. PDP main aim is to ensure that the client file is intact and has not been tampered, whereas POR main aim is to guarantee that the client can retrieve the file even with small file corruption. Both have real?world usage and is critical for today’s data-centric world.

Conclusions: The differences between PDP and POR schemas are becoming less with each new iteration. This thesis demonstrates the difference and weaknesses in both approaches and provides a conceptual model as a building block to further the research in this area.