Compact Proofs of Retrievability

By Hovav Shacham, Brent Waters. Journal of Cryptology, 2008

2,171 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/ed5685db1beb05fea431a5548a115a099f656418

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Information Systems

Citations in the corpus

Proofs of ownership in remote storage systems (2011, methodology): “However, this role reversal is signi.cant, and in particular the advanced POR and PDP protocols in the literature are inapplicable in our setting, see more discussion in Section 1.3.”
Permacoin: Repurposing Bitcoin Work for Data Preservation (2014, background): “The original construction [5] has been followed by variants, including some with improved efficiency [26, 27], public verifiability [5, 27], distributed variants, e.”
Blockchain Based Data Integrity Service Framework for IoT Data (2017, methodology): “For example, [17] enables public verifiability and infinite verifications based on PoR model.”
Data Security and Privacy Protection for Cloud Storage: A Survey (2020, methodology): “In order to check the integrity, existing solutions include provable data possession (PDP) model proposed by Ateniese et al. [2] and proof of retrievability (POR) model presented by Shacham and Waters [69].”
Verifiable Delegation of Computation over Large Datasets (2011, background): “The problem of proof of retrievability was first posed in [50,36], and subsequent protocols include [4,55,22].”
Enabling Security in Cloud Storage SLAs with CloudProof (2011, background): “…the chained hash of C will have to depend on the chain hash of A. Due to the client-supplied randomness and hardness assumptions on the hash function (random oracle), the cloud can compute the chain hash for A only when he gets the A request which happens after the C chain hash was given out.”
Privacy and Access Control for Outsourced Personal Records (2015, background): “Other related approaches are proofs-of-retrievability [59]–[62], which allow the server to prove to the client that it is actually storing all of the client’s data, veriﬁable databases [63], which differ from the previous ones in that the size of the database is ﬁxed during the setup phase, and…”
Dynamic Audit Services for Outsourced Storages in Clouds (2013, background): “In addition, it is evidently impractical for audit services to download the whole data for checking data validation due to the communication cost, especially for large-size files.”
Remote data checking using provable data possession (2011, background): “Indeed, several of the proposed use of FEC codes [Juels and Kaliski 2007; Shacham and Waters 2008] is not optimal, and may result in poor I/O and encoding performance.”
DupLESS: Server-Aided Encryption for Deduplicated Storage (2013, methodology): “Our approaches may be used in conjunction with existing mechanisms for availability auditing [13] [41] [51] [70] or file replication across multiple services [26].”
Depot: Cloud Storage with Minimal Trust (2010, background): “For example, it may be useful to audit storage service providers with black box tests to verify that they are storing data as promised [52, 86, 87], but we do not examine that issue.”
A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding (2012, background): “The concept of provable data possession [20], [21] and the notion of proof of storage [22], [23], [24] are proposed.”
A Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public Verifiability (2011, background): “Several recent studies [32], [33], [34] propose PoR schemes that improve the protocol security and efficiency.”
Verifying computations with state (2013, background): “While that might be disconcerting, Pantry’s goal is to establish that a remote execution is consistent with an expressed computation; program verification is a complementary concern (§1).”
Proxy Provable Data Possession in Public Clouds (2013, background): “After that, Shacham and Waters [15] gave the first PORs protocol with full security proofs against arbitrary adversaries .”