Pages that link to "Item:Q3036697"
From MaRDI portal
The following pages link to Authenticated Algorithms for Byzantine Agreement (Q3036697):
Displaying 17 items.
- Synchronizable fair exchange (Q6581797) (← links)
- Broadcast-optimal four-round MPC in the plain model (Q6582165) (← links)
- Network agnostic MPC with statistical security (Q6582167) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
- Memory checking for parallel RAMs (Q6582183) (← links)
- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults (Q6587961) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Network-agnostic multi-party computation revisited (extended abstract) (Q6635768) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
- Early stopping for any number of corruptions (Q6637339) (← links)
- Closing the efficiency gap between synchronous and network-agnostic consensus (Q6637554) (← links)
- Sublinear message bounds of authenticated implicit Byzantine agreement (Q6646446) (← links)
- Detecting causality in the presence of Byzantine processes: the case of synchronous systems (Q6647755) (← links)
- Adaptively secure BLS threshold signatures from DDH and co-CDH (Q6653010) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
- Round efficient Byzantine agreement from VDFs (Q6660385) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)