Pages that link to "Item:Q3177735"
From MaRDI portal
The following pages link to Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time (Q3177735):
Displaying 9 items.
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time (Q2406433) (← links)
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP (Q6535024) (← links)
- Improved extension protocols for Byzantine broadcast and agreement (Q6535027) (← links)
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! (Q6579852) (← links)
- Asymmetric distributed trust (Q6601210) (← links)
- Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs (Q6614029) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)
