Order-fairness for Byzantine consensus

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

zbMATH Keywords

state machine replicationAequitas

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 1848309 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Asynchronous consensus and broadcast protocols
• Atomic broadcast: From simple message diffusion to Byzantine agreement
• Authenticated Algorithms for Byzantine Agreement
• Blockchain consensus protocols in the wild (keynote talk)
• Efficient Byzantine Fault-Tolerance
• FruitChains: a fair blockchain
• HotStuff
• Hybrid consensus: efficient consensus in the permissionless model
• Majority is not enough: bitcoin mining is vulnerable
• Order-fairness for Byzantine consensus
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• The Byzantine Generals Problem
• Thunderella: blockchains with optimistic instant confirmation
• Universally Composable Security with Global Setup

Cited in

(16)

• Simplex consensus: a simple and fast consensus protocol
• Wendy grows up: more order fairness
• SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies
• Clairvoyant state machine replications
• Be aware of your leaders
• Quick order fairness
• Sliding window challenge process for congestion detection
• Credible decentralized exchange design via verifiable sequencing rules
• BeeGees: Stayin' Alive in Chained BFT
• Total ordering algorithms for asynchronous Byzantine systems
• Universal composable transaction serialization with order fairness
• Order-fairness for Byzantine consensus
• Byzantine-resistant total ordering algorithms.
• scientific article; zbMATH DE number 3896285 (Why is no real title available?)
• Ordering transactions with bounded unfairness: definitions, complexity and constructions
• 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)