Pages that link to "Item:Q6487529"
From MaRDI portal
The following pages link to On the round complexity of randomized Byzantine agreement (Q6487529):
Displaying 9 items.
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (Q916352) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits (Q3646244) (← links)
- Fully Polynomial Byzantine Agreement for <i>n</i> > 3<i>t</i> Processors in <i>t</i> + 1 Rounds (Q4388871) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
