Byzantine generals in the permissionless setting

DOI10.1007/978-3-031-47754-6_2MaRDI QIDQ6573944zbMATH OpenFDO

Authors Andrew E. M. Lewis, Tim Roughgarden

Publication date 17 July 2024

zbMATH Keywords

consensusproof-of-workproof-of-stakeproof-of-space

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Analysis of the Blockchain Protocol in Asynchronous Networks
• Hybrid consensus: efficient consensus in the permissionless model
• Permissionless consensus in the resource model
• Proof-of-work-based consensus in expected-constant time
• SoK: a consensus taxonomy in the blockchain era

Cites work

• Authenticated Algorithms for Byzantine Agreement
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Permissionless consensus in the resource model
• Proof of space from stacked expanders
• Reaching Agreement in the Presence of Faults
• Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
• Synchronous, with a chance of partition tolerance
• The Bitcoin Backbone Protocol: Analysis and Applications
• The Byzantine Generals Problem

Cited in

(2)

• Proof-of-work-based consensus in expected-constant time
• Towards permissionless consensus in the standard model via fine-grained complexity

This page was built for publication: Byzantine generals in the permissionless setting

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