Provable Data Possession (PDP) and Proofs of Retrievability (POR) of Current Big User Data

  • Walker I
  • Hewage C
  • Jayal A
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 several interesting privacy and security issues. One of the biggest concerns with third-party data storage providers is accountability. This article, critically reviews two schemas/algorithms that allow users to check the integrity and availability of their outsourced data on untrusted data stores (i.e., third-party data storages). The reviewed schemas are provable data possession (PDP) and proofs of retrievability (POR). Both are cryptographic protocols designed to provide clients the assurance that their data are secure on the untrusted data storages. Furthermore, a conceptual framework is proposed to mitigate the weaknesses of the current storage solutions.

Cite

CITATION STYLE

APA

Walker, I., Hewage, C., & Jayal, A. (2022). Provable Data Possession (PDP) and Proofs of Retrievability (POR) of Current Big User Data. SN Computer Science, 3(1). https://doi.org/10.1007/s42979-021-00968-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free