Proofs of Retrievability via Hardness Amplification

By Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs. IACR Cryptology ePrint Archive, 2009

486 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Information Systems

View Paper: https://www.semanticscholar.org/paper/3b30ffd905aaa30e8bff75b3bff2c7a47a9860d1

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 Computer Networks and Communications

In Information Systems

Citations in the corpus

Proofs of retrievability: theory and implementation (2009, methodology): “The focus of [8] is mostly theoretical in providing extraction guarantees for adversaries replying correctly to an arbitrary small fraction of challenges.”
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.”
Cryptographic Cloud Storage (2010, background): “Improved definitions and constructions were given in [30,14, 20 ,3] and dynamic proofs of storage (where the data can be updated) are considered in [4,21,33].”
Dynamic provable data possession (2009, methodology): “Furthermore, this definition can be applied to the POR case [7, 12, 31], in which by repeatin g the challenge-response process, the extractor can extract the whole file with the help of error-co recting codes.”
Proxy Provable Data Possession in Public Clouds (2013, background): “This model attracts many researchers and some PORs protocols are designed [16], [17], [18], [19].”
Compact Proofs of Retrievability (2008, background): “Dodis, Vadhan, and Wichs [15] and, independently, Bowers, Juels, and Oprea [10] both observed that the “B coefficients” in our queries are a Hadamard code in disguise, and that more efficient error-correcting codes can substantially reduce the query size.”
Privacy-Preserving Public Auditing for Secure Cloud Storage (2013, background): “[29] also give a study on different variants of PoR with private auditability.”
Verifiable Delegation of Computation over Large Datasets (2011, background): “All of these protocols incur a substantial storage overhead for the server (since the file is stored using an erasure code) and, except for [22], require communication which is quadratic in the security parameter.”
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.”
Cooperative Provable Data Possession for Integrity Verification in Multicloud Storage (2012, background): “Furthermore, several POR schemes and models have been recently proposed including [9], [10].”