Pages that link to "Item:Q5248470"
From MaRDI portal
The following pages link to Fast asynchronous Byzantine agreement with optimal resilience (Q5248470):
Displaying 30 items.
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
- On the complexity of asynchronous agreement against powerful adversaries (Q901869) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- Revisiting asynchronous fault tolerant computation with optimal resilience (Q2166363) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Asynchronous Byzantine agreement with optimal resilience (Q2251153) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669) (← links)
- (Q5091088) (← links)
- Randomized protocols for asynchronous consensus (Q5138489) (← links)
- Resilient-optimal interactive consistency in constant time (Q5138494) (← links)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP (Q6535024) (← links)
- Proof of availability and retrieval in a modular blockchain architecture (Q6573989) (← links)
- FaBFT: flexible asynchronous BFT protocol using DAG (Q6575059) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Simplex consensus: a simple and fast consensus protocol (Q6587963) (← links)
- Asymmetric distributed trust (Q6601210) (← links)
- Network-agnostic multi-party computation revisited (extended abstract) (Q6635768) (← links)
- Closing the efficiency gap between synchronous and network-agnostic consensus (Q6637554) (← links)
- Linear-communication asynchronous complete secret sharing with optimal resilience (Q6653035) (← links)