Proofs of Retrievability via Hardness Amplification

DOI10.1007/978-3-642-00457-5_8zbMath1213.68246OpenAlexW1480620864MaRDI QIDQ3611762

Daniel Wichs, Yevgeniy Dodis, Salil P. Vadhan

Publication date: 3 March 2009

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_8

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (14)

Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage ⋮ Compact proofs of retrievability ⋮ Private Certificate-Based Remote Data Integrity Checking in Public Clouds ⋮ DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability ⋮ Zero-knowledge proofs of retrievability ⋮ Towards Proofs of Ownership Beyond Bounded Leakage ⋮ Keyword-Based Delegable Proofs of Storage ⋮ Efficient proofs of retrievability using expander codes ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Multi-prover proof of retrievability ⋮ Generic constructions of PoRs from codes and instantiations ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ An alternative approach to public cloud data auditing supporting data dynamics ⋮ Incompressible encodings

This page was built for publication: Proofs of Retrievability via Hardness Amplification