The bitcoin backbone protocol: analysis and applications
From MaRDI portal
Cites work
- Adaptively secure broadcast
- Adaptively secure broadcast, revisited
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- Bootstrapping the blockchain, with applications to consensus and fast PKI setup
- But why does it work? A rational protocol design treatment of bitcoin
- Concentration of measure for the analysis of randomized algorithms.
- Distributed consensus revisited
- Early stopping in Byzantine agreement
- Efficient algorithms for anonymous Byzantine agreement
- Efficient player-optimal protocols for strong and differential consensus
- Fair and robust multi-party computation using a global transaction ledger
- FruitChains: a fair blockchain
- How to use bitcoin to design fair protocols
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 1931811 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- Levels of authentication in distributed agreement
- On expected constant-round protocols for Byzantine agreement
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- PoW-based distributed cryptography with no trusted setup
- Reaching Agreement in the Presence of Faults
- Secure computation without authentication
- Security and composition of multiparty cryptographic protocols
- SoK: a consensus taxonomy in the blockchain era
- The Bitcoin backbone protocol with chains of variable difficulty
- The Bitcoin Backbone Protocol: Analysis and Applications
- The Byzantine Generals Problem
- Universally composable security
- Universally composable synchronous computation
Cited in
(6)- Improved quantum lifting by coherent measure-and-reprogram
- NISQ security and complexity via simple classical reasoning
- Byzantine-tolerant distributed grow-only sets: specification and applications
- Optimal good-case latency for sleepy consensus
- The economic limits of permissionless consensus
- Adaptive proof-of-stake governance: a game-theoretic approach to consensus mechanisms
This page was built for publication: The bitcoin backbone protocol: analysis and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993553)
