The following pages link to HotStuff (Q5145234):
Displaying 39 items.
- Aggregatable distributed key generation (Q2056680) (← links)
- The sum of its parts: analysis of federated Byzantine agreement systems (Q2084977) (← links)
- Order-fairness for Byzantine consensus (Q2102076) (← links)
- The fault-tolerant cluster-sending problem (Q2103916) (← links)
- Making Byzantine consensus live (Q2104036) (← links)
- Blockchain CAP theorem allows user-dependent adaptivity and finality (Q2147233) (← links)
- PoSAT: proof-of-work availability and unpredictability, without the work (Q2147235) (← links)
- Towards self-stabilizing blockchain, reconstructing totally erased blockchain (Q2672262) (← links)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
- Consensus in Data Management: From Distributed Commit to Blockchain (Q5886006) (← links)
- Be aware of your leaders (Q6045205) (← links)
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback (Q6045206) (← links)
- The availability-accountability dilemma and its resolution via accountability gadgets (Q6045232) (← links)
- Three attacks on proof-of-stake ethereum (Q6045235) (← links)
- Plumo: an ultralight blockchain client (Q6045243) (← links)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)
- Consensus on demand (Q6155257) (← links)
- On elapsed time consensus protocols (Q6157609) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- On the Validity of Consensus (Q6202272) (← links)
- A Secure Cross-Shard View-Change Protocol for Sharding Blockchains (Q6488393) (← links)
- Making Byzantine consensus live (Q6535021) (← links)
- Expected linear round synchronization: the missing link for linear Byzantine SMR (Q6535025) (← links)
- Quorum tree abstractions of consensus protocols (Q6535243) (← links)
- The consensus machine: formalising consensus in the presence of malign agents (Q6535829) (← links)
- Executing and proving over dirty ledgers (Q6573943) (← links)
- The unique chain rule and its applications (Q6573946) (← links)
- Player-replaceability and forensic support are two sides of the same (crypto) coin (Q6573949) (← links)
- Fair delivery of decentralised randomness beacon (Q6573966) (← links)
- Proof of availability and retrieval in a modular blockchain architecture (Q6573989) (← links)
- State machines across isomorphic layer 2 ledgers (Q6573991) (← links)
- FaBFT: flexible asynchronous BFT protocol using DAG (Q6575059) (← links)
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! (Q6579852) (← links)
- Liveness and latency of Byzantine state-machine replication (Q6579855) (← links)
- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults (Q6587961) (← links)
- Simplex consensus: a simple and fast consensus protocol (Q6587963) (← links)
- Asymmetric distributed trust (Q6601210) (← links)
- Asymptotically optimal message dissemination with applications to blockchains (Q6637325) (← links)
- Adaptively secure BLS threshold signatures from DDH and co-CDH (Q6653010) (← links)
