Proof of availability and retrieval in a modular blockchain architecture
From MaRDI portal
Publication:6573989
DOI10.1007/978-3-031-47751-5_3zbMATH Open1543.94721MaRDI QIDQ6573989FDOQ6573989
Authors: Shir Cohen, Guy Goren, Lefteris Kokoris Kogias, Alberto Sonnino, Alexander Spiegelman 
Publication date: 17 July 2024
Recommendations
- Fraud and data availability proofs: detecting invalid blocks in light clients
- Inclusive Block Chain Protocols
- PoSAT: proof-of-work availability and unpredictability, without the work
- Coded Merkle tree: solving data availability attacks in blockchains
- Ouroboros: a provably secure proof-of-stake blockchain protocol
Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)
Cites Work
- Impossibility of distributed consensus with one faulty process
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast asynchronous Byzantine agreement with optimal resilience
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Vector commitments and their applications
- Title not available (Why is that?)
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- HotStuff
- Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- All You Need is DAG
This page was built for publication: Proof of availability and retrieval in a modular blockchain architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573989)
