Pages that link to "Item:Q5096793"
From MaRDI portal
The following pages link to Unconditional Byzantine agreement for any number of faulty processors (Q5096793):
Displaying 9 items.
- Multi-verifier signatures (Q431790) (← links)
- Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
