Simplex consensus: a simple and fast consensus protocol
From MaRDI portal
Publication:6587963
DOI10.1007/978-3-031-48624-1_17zbMATH Open1545.94055MaRDI QIDQ6587963FDOQ6587963
Rafael Pass, Author name not available (Why is that?)
Publication date: 15 August 2024
digital signature schemecollision-resistant hash functionsrandom leader election oraclerotating leader/random leader model of consensus
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cites Work
- A Pseudorandom Generator from any One-way Function
- The Byzantine Generals Problem
- Concurrent general composition of secure protocols in the timing model
- Fast asynchronous Byzantine agreement with optimal resilience
- The Bitcoin Backbone Protocol: Analysis and Applications
- Universally Composable Synchronous Computation
- The sleepy model of consensus
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Thunderella: blockchains with optimistic instant confirmation
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger
- Order-fairness for Byzantine consensus
- Random oracles in constantipole
- TARDIS: a foundation of time-lock puzzles in UC
- Algorand: a secure and efficient distributed ledger
- The Hidden Graph Model
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- HotStuff
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- All You Need is DAG
- Good-case Latency of Byzantine Broadcast
- Internet Computer Consensus
- Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
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)
