Proofs of Retrievability via Hardness Amplification

DOI10.1007/978-3-642-00457-5_8MaRDI QIDQ3611762zbMATH OpenOpenAlexFDO

Authors Yevgeniy Dodis, Daniel Wichs, Salil 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)

Recommendations

• Compact proofs of retrievability
• Proofs of retrievability via fountain code
• Compact Proofs of Retrievability
• A coding theory foundation for the analysis of general unconditionally secure proof-of-retrievability schemes for cloud storage
• Multi-prover proof of retrievability

Cited in

(26)

• Multi-prover proof of retrievability
• Generic constructions of PoRs from codes and instantiations
• Incompressible encodings
• New techniques in replica encodings with client setup
• Lightweight delegatable proofs of storage
• An alternative approach to public cloud data auditing supporting data dynamics
• Compact proofs of retrievability
• Proofs of storage: theory, constructions and applications
• Towards proofs of ownership beyond bounded leakage
• Private certificate-based remote data integrity checking in public clouds
• DD-POR: dynamic operations and direct repair in network coding-based proof of retrievability
• Leakage-resilient identification schemes from zero-knowledge proofs of storage
• Zero-knowledge proofs of retrievability
• Proofs of storage from homomorphic identification protocols
• Dynamic proofs of retrievability via oblivious RAM
• Dynamic proofs of retrievability via oblivious RAM
• Proofs of retrievability via fountain code
• Hardness Amplification Proofs Require Majority
• Homomorphic linear authentication schemes from -ASU₂ functions for proofs of retrievability
• Multi-theorem preprocessing NIZKs from lattices
• Keyword-Based Delegable Proofs of Storage
• Efficient proofs of retrievability using expander codes
• Accountable storage
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
• FRIDA: data availability sampling from FRI
• Foundations of data availability sampling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611762)