An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
From MaRDI portal
Publication:4376159
DOI10.1137/S0097539790187084zbMath0885.68077WikidataQ56032156 ScholiaQ56032156MaRDI QIDQ4376159
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Combinatorics in computer science (68R05) Cryptography (94A60) Communication, information (94A99) Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of error-correcting codes and error-detecting codes (94B99) Distributed algorithms (68W15)
Related Items (37)
On the round complexity of randomized Byzantine agreement ⋮ Lower bound for scalable Byzantine agreement ⋮ Improving the round complexity of VSS in point-to-point networks ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Round-optimal Byzantine agreement ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ Algorand: a secure and efficient distributed ledger ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Multidimensional Byzantine agreement in a synchronous setting ⋮ Tight bound on mobile Byzantine agreement ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Brief Announcement: Improved Consensus in Quantum Networks ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ Cryptography and cryptographic protocols ⋮ Resilient-optimal interactive consistency in constant time ⋮ Spatial reference frame agreement in quantum networks ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Resilient Distributed Field Estimation ⋮ Perennial secure multi-party computation of universal Turing machine ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Asynchronous Byzantine agreement with optimal resilience ⋮ Secure multi-party computation made simple ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ ⋮ How Byzantine is a send corruption? ⋮ Perfect information leader election in \(\log^*n+O(1)\) rounds
This page was built for publication: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
