scientific article; zbMATH DE number 4121395
From MaRDI portal
Publication:4734747
Recommendations
Cited in
(23)- On the message complexity of binary Byzantine agreement under crash failures
- Order-fairness for Byzantine consensus
- Instant block confirmation in the sleepy model
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Optimal extension protocols for Byzantine broadcast and agreement
- A characterization of eventual Byzantine agreement
- ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS
- Flipping Persuasively in Constant Time
- THE PROPORTIONAL LOTTERY PROTOCOL IS STRONGLY β-PARTICIPATORY AND VNM-STRATEGY-PROOF
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- Message-optimal protocols for Byzantine Agreement
- scientific article; zbMATH DE number 176512 (Why is no real title available?)
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Optimally efficient multi-valued byzantine agreement
- Near-optimal self-stabilising counting and firing squads
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- scientific article; zbMATH DE number 7774289 (Why is no real title available?)
- Total ordering algorithms for asynchronous Byzantine systems
- Asymptotically free broadcast in constant expected time via packed VSS
- A new solution for the Byzantine agreement problem
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- On the round complexity of fully secure solitary MPC with honest majority
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4734747)
