Proof of availability and retrieval in a modular blockchain architecture

DOI10.1007/978-3-031-47751-5_3MaRDI QIDQ6573989zbMATH OpenFDO

Authors Shir Cohen, Guy Goren, Lefteris Kokoris Kogias, Alberto Sonnino, Alexander Spiegelman

Publication date 17 July 2024

zbMATH Keywords

modular design architecturepulling sub-protocols

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 3877077 (Why is no real title available?)
• scientific article; zbMATH DE number 3910296 (Why is no real title available?)
• scientific article; zbMATH DE number 1848309 (Why is no real title available?)
• All You Need is DAG
• Asymptotically Optimal Validated Asynchronous Byzantine Agreement
• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
• Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
• Fast asynchronous Byzantine agreement with optimal resilience
• HotStuff
• Impossibility of distributed consensus with one faulty process
• Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Vector commitments and their applications

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)