Pages that link to "Item:Q1186809"
From MaRDI portal
The following pages link to Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809):
Displaying 10 items.
- Efficient agreement using fault diagnosis. (Q1312601) (← links)
- Fast consensus in networks of bounded degree. (Q1312604) (← links)
- Performance study of Byzantine agreement protocol with artificial neural network (Q2384832) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Broadcast from Minicast Secure Against General Adversaries (Q3449517) (← links)
- Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323) (← links)
- Optimal time byzantine agreement for t <n/8 with linear-messages (Q5137009) (← links)
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links (Q5137014) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)