Order-fairness for Byzantine consensus
From MaRDI portal
Publication:2102076
DOI10.1007/978-3-030-56877-1_16zbMATH Open1504.94158OpenAlexW3013718028MaRDI QIDQ2102076FDOQ2102076
Authors: Mahimna Kelkar, Fan Zhang, Steven Goldfeder, Ari Juels 
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_16
Recommendations
- Total ordering algorithms for asynchronous Byzantine systems
- Byzantine Fault Detectors for Solving Consensus
- Consensus in Byzantine asynchronous systems
- Asynchronous Byzantine agreement with optimal resilience
- Efficient Byzantine Agreement with Faulty Minority
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- scientific article; zbMATH DE number 4121395
- Round-optimal Byzantine agreement
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
Cites Work
- Authenticated Algorithms for Byzantine Agreement
- The Byzantine Generals Problem
- Asynchronous consensus and broadcast protocols
- Universally Composable Security with Global Setup
- Majority Is Not Enough: Bitcoin Mining Is Vulnerable
- Advances in Cryptology - CRYPTO 2003
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- Efficient Byzantine Fault-Tolerance
- Thunderella: blockchains with optimistic instant confirmation
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- FruitChains
- Order-fairness for Byzantine consensus
- Title not available (Why is that?)
- HotStuff
- Hybrid consensus: efficient consensus in the permissionless model
- Blockchain consensus protocols in the wild (keynote talk)
Cited In (16)
- Byzantine-resistant total ordering algorithms.
- Order-fairness for Byzantine consensus
- Simplex consensus: a simple and fast consensus protocol
- Clairvoyant state machine replications
- Be aware of your leaders
- Quick order fairness
- Sliding window challenge process for congestion detection
- Wendy grows up: more order fairness
- SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies
- BeeGees: Stayin' Alive in Chained BFT
- Ordering transactions with bounded unfairness: definitions, complexity and constructions
- Universal composable transaction serialization with order fairness
- Title not available (Why is that?)
- Credible decentralized exchange design via verifiable sequencing rules
- Total ordering algorithms for asynchronous Byzantine systems
- Differential privacy in constant function market makers
This page was built for publication: Order-fairness for Byzantine consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102076)
