Asynchronous byzantine agreement protocols

From MaRDI portal
Publication:1091131

DOI10.1016/0890-5401(87)90054-XzbMath0622.68032MaRDI QIDQ1091131

Gabriel Bracha

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)




Related Items

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model CheckerHigh-threshold AVSS with optimal communication complexitySignature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant TimeRevisiting asynchronous fault tolerant computation with optimal resilienceSignature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant timeOn the Versatility of Bracha’s Byzantine Reliable Broadcast AlgorithmRandomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systemsAsynchronous Byzantine reliable broadcast with a message adversaryByzantine preferential votingTotal ordering algorithms for asynchronous Byzantine systemsReaching consensus for asynchronous distributed key generationCross-chain payment protocols with success guaranteesExpected linear round synchronization: the missing link for linear Byzantine SMRConsensus on demandMultidimensional agreement in Byzantine systemsUnnamed ItemDistributed CONGEST Algorithms against Mobile AdversariesA reduction theorem for randomized distributed algorithms under weak adversariesByzantine-tolerant causal broadcastConsensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failuresUnnamed ItemAlways have a backup plan: fully secure synchronous MPC with asynchronous fallbackByzantine-resistant total ordering algorithms.Making Byzantine consensus live



Cites Work


This page was built for publication: Asynchronous byzantine agreement protocols