HotStuff
From MaRDI portal
Publication:5145234
Recommendations
Cited in
(61)- Quorum tree abstractions of consensus protocols
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Making Byzantine consensus live
- Making Byzantine consensus live
- The fault-tolerant cluster-sending problem
- High Performance, Low Energy, and Trustworthy Blockchains Using Satellites
- Order-fairness for Byzantine consensus
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- Swiper: a new paradigm for efficient weighted distributed protocols
- TetraBFT: reducing latency of unauthenticated, responsive BFT consensus
- Probabilistic Byzantine fault tolerance
- All Byzantine agreement problems are expensive
- DARE to agree: Byzantine agreement with optimal resilience and adaptive communication
- Lumiere: making optimal BFT for partial synchrony practical
- BBCA-\textsc{Chain}: low latency, high throughput BFT consensus on a DAG
- \textsf{Goldfish}: No more attacks on Ethereum?!
- 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
- Dynamic-FROST: Schnorr threshold signatures with a flexible committee
- 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
- Information theoretic HotStuff
- \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
- High-throughput permissionless blockchain consensus under realistic network assumptions
- State machine replication among strangers, fast and self-sufficient
- 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
- Glacius: threshold Schnorr signatures from DDH with full adaptive security
- Centroid approximation with multidimensional approximate agreement protocols
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- BAR Nash equilibrium and application to blockchain design
- On elapsed time consensus protocols
- The sum of its parts: analysis of federated Byzantine agreement systems
- The consensus machine: formalising consensus in the presence of malign agents
- Consensus on demand
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)
