Decentralized data archival: new definitions and constructions
From MaRDI portal
Cites work
- Compact proofs of retrievability
- Constant-Size Commitments to Polynomials and Their Applications
- Decomposable searching problems I. Static-to-dynamic transformation
- Fast Reed-Solomon interactive oracle proofs of proximity
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- Foundations of data availability sampling
- Fraud and data availability proofs: detecting invalid blocks in light clients
- FRIDA: data availability sampling from FRI
- scientific article; zbMATH DE number 7788481 (Why is no real title available?)
- Locally updatable and locally decodable codes
- Proofs of Catalytic Space
- Proofs of storage from homomorphic identification protocols
- Random Oracles and Auxiliary Input
- Random oracles and non-uniformity
- Tight proofs of space and replication
- Time space tradeoffs for attacks against one-way functions and PRGs
- Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
- Untangling the security of Kilian's protocol: upper and lower bounds
- Verifying distributed erasure-coded data
This page was built for publication: Decentralized data archival: new definitions and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445649)