HotStuff
From MaRDI portal
Publication:5145234
DOI10.1145/3293611.3331591OpenAlexW2964159515MaRDI QIDQ5145234FDOQ5145234
Authors: Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, Ittai Abraham 
Publication date: 20 January 2021
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3293611.3331591
Cited In (45)
- Quorum tree abstractions of consensus protocols
- Making Byzantine consensus live
- High Performance, Low Energy, and Trustworthy Blockchains Using Satellites
- Making Byzantine consensus live
- The fault-tolerant cluster-sending problem
- Order-fairness for Byzantine consensus
- Executing and proving over dirty ledgers
- Fair delivery of decentralised randomness beacon
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- Proof of availability and retrieval in a modular blockchain architecture
- The unique chain rule and its applications
- State machines across isomorphic layer 2 ledgers
- FaBFT: flexible asynchronous BFT protocol using DAG
- Reaching consensus for asynchronous distributed key generation
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
- Liveness and latency of Byzantine state-machine replication
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Simplex consensus: a simple and fast consensus protocol
- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
- Be aware of your leaders
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- Plumo: an ultralight blockchain client
- Three attacks on proof-of-stake ethereum
- Asymmetric distributed trust
- Consensus in Data Management: From Distributed Commit to Blockchain
- Blockchain CAP theorem allows user-dependent adaptivity and finality
- PoSAT: proof-of-work availability and unpredictability, without the work
- \textsc{FnF-BFT}: a BFT protocol with provable performance under attack
- Divide \& Scale: formalization and roadmap to robust sharding
- PAPR: publicly auditable privacy revocation for anonymous credentials
- BeeGees: Stayin' Alive in Chained BFT
- On the Amortized Communication Complexity of Byzantine Broadcast
- On the Validity of Consensus
- Asymptotically optimal message dissemination with applications to blockchains
- Towards self-stabilizing blockchain, reconstructing totally erased blockchain
- Aggregatable distributed key generation
- A Secure Cross-Shard View-Change Protocol for Sharding Blockchains
- The availability-accountability dilemma and its resolution via accountability gadgets
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- On elapsed time consensus protocols
- The consensus machine: formalising consensus in the presence of malign agents
- Consensus on demand
- The sum of its parts: analysis of federated Byzantine agreement systems
This page was built for publication: HotStuff
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145234)
