Pors: proofs of retrievability for large files

By Ari Juels, B. Kaliski. Conference on Computer and Communications Security, 2007

2,561 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

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

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

1. Kui Ren
2. Wenjing Lou
3. Dan Boneh
4. Brent Waters
5. Jonathan Katz
6. Giuseppe Ateniese
7. Seny Kamara
8. Qian Wang

In Information Systems

1. Wenjing Lou
2. Kui Ren
3. Giuseppe Ateniese
4. Ari Juels
5. Brent Waters
6. Qian Wang
7. Jonathan Katz
8. Dan Boneh

Citations in the corpus

• Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud (2015, background): “Proofs of Retrievability ( POR ) [ 35 ] is another direction to check the correctness of data stored in a semi - trusted server .”
• Cloud Computing Security: From Single to Multi-clouds (2012, methodology): “Proofs of Retrievability (PORs) and Proofs of Data Possession (PDP) are protocols introduced by Juels and Kaliski [24] and Ateniese et al. [7] to ensure high probability for the retrieval of the user’s data.”
• A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks (2018, background): “interactive PoR in [105]), the node needs a publicly known and non-precomputable puzzle ID to seed the process of segment selection called ‘‘scratch-off’’.”
• An Efficient and Secure Dynamic Auditing Protocol for Data Storage in Cloud Computing (2013, background): “We further extend our auditing protocol to support batch auditing for both multiple owners and multiple clouds, without using any trusted organizer.”
• Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services (2017, background): “These are known under the name of Proofs of Retrievability (PoR) [32] and they all work by requiring that the prover shows the possession of a certain number of blocks previously authenticated by the client5.”
• Compact Proofs of Retrievability (2008, methodology): “We recall the security definition of Juels and Kaliski [12].”
• Provable data possession at untrusted stores (2007, background): “Although comparable in scope with PDP, their POR scheme can only be applied to encrypted .les and can handle only a limited numberofqueries,whichhastobe .xed apriori.”
• Proofs of Storage from Homomorphic Identification Protocols (2009, methodology): “The high-level ideas are similar to those in [15], though the proof here is a bit simpler.”
• Security and privacy for storage and computation in cloud computing (2014, methodology): “Juels et al. [22] proposed the definition of proof of retrievability (PoR), which used spot-checking and error-correcting codes to ensure both possession and retrievability for data file on archive service system.”
• An Efficient Public Auditing Protocol With Novel Dynamic Structure for Cloud Data (2017, background): “Only the DO possesses the private key, and the entire auditing process is executed by the owner [20]–[22].”
• Verifying Computations with Streaming Interactive Proofs (2011, background): “Cloud computing applications have also motivated a lengthy line of prior work in the cryptography community on “proofs of retrievability”, which allow to verify that data is stored correctly by the cloud (see [16] and the references therein).”
• Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing (2009, methodology): “Moreover, as will be shown later, the direct extension of the current provable data possession (PDP) [2] or proof of retrievability (PoR) [1, 3 ] schemes to support data dynamics may lead to security loopholes.”
• Dynamic Data Operations with Deduplication in Privacy-Preserving Public Auditing for Secure Cloud Storage (2017, positive): “[10] firstly proposed Proof of Retrievability (PoR) model for assuring the data possession and retrievability.”
• 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.”