Order-fairness for Byzantine consensus

DOI10.1007/978-3-030-56877-1_16zbMath1504.94158OpenAlexW3013718028MaRDI QIDQ2102076

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)

Related Items (8)

Wendy grows up: more order fairness ⋮ SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies ⋮ Differential privacy in constant function market makers ⋮ Be aware of your leaders ⋮ Quick order fairness ⋮ Sliding window challenge process for congestion detection ⋮ BeeGees: Stayin' Alive in Chained BFT ⋮ Order-fairness for Byzantine consensus

Cites Work

• Unnamed Item
• Thunderella: blockchains with optimistic instant confirmation
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Atomic broadcast: From simple message diffusion to Byzantine agreement
• Order-fairness for Byzantine consensus
• Majority Is Not Enough: Bitcoin Mining Is Vulnerable
• Authenticated Algorithms for Byzantine Agreement
• Universally Composable Security with Global Setup
• Asynchronous consensus and broadcast protocols
• The Byzantine Generals Problem
• HotStuff
• Efficient Byzantine Fault-Tolerance
• FruitChains
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Order-fairness for Byzantine consensus