Simplex consensus: a simple and fast consensus protocol
From MaRDI portal
Publication:6587963
Recommendations
Cites work
- A Pseudorandom Generator from any One-way Function
- Algorand: a secure and efficient distributed ledger
- All You Need is DAG
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Concurrent general composition of secure protocols in the timing model
- Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
- Fair and robust multi-party computation using a global transaction ledger
- Fast asynchronous Byzantine agreement with optimal resilience
- Good-case Latency of Byzantine Broadcast
- HotStuff
- Internet Computer Consensus
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Order-fairness for Byzantine consensus
- Random oracles in constantipole
- TARDIS: a foundation of time-lock puzzles in UC
- The Bitcoin Backbone Protocol: Analysis and Applications
- The Byzantine Generals Problem
- The hidden graph model: communication locality and optimal resiliency with adaptive faults
- The sleepy model of consensus
- Thunderella: blockchains with optimistic instant confirmation
- Universally composable synchronous computation
This page was built for publication: Simplex consensus: a simple and fast consensus protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587963)