On Optimal Probabilistic Asynchronous Byzantine Agreement

DOI10.1007/978-3-540-77444-0_7MaRDI QIDQ5445740zbMATH OpenOpenAlexFDO

Authors Amjed Shareef, C. Pandu Rangan

Publication date 6 March 2008

Published in Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77444-0_7

zbMATH Keywords

Byzantine agreement problemcomputationally bounded Byzantine adversaryDistributed computingfault tolerance

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Asynchronous byzantine agreement protocols
• Asynchronous consensus and broadcast protocols
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• scientific article; zbMATH DE number 6297761
• Byzantine agreement given partial broadcast

Cites work

• A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring
• scientific article; zbMATH DE number 1848309 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Optimally efficient multi-valued byzantine agreement
• Practical threshold signatures
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Reaching Agreement in the Presence of Faults
• Universal classes of hash functions
• Unreliable failure detectors for reliable distributed systems

Cited in

(37)

• Asynchronous byzantine agreement protocols
• Two distributed problems involving Byzantine processes
• Low complexity Byzantine-resilient consensus
• The sum of its parts: analysis of federated Byzantine agreement systems
• How Byzantine is a send corruption?
• Order-fairness for Byzantine consensus
• Round-optimal Byzantine agreement
• Synchronous consensus with optimal asynchronous fallback guarantees
• Optimal decision strategies in Byzantine environments
• Optimal extension protocols for Byzantine broadcast and agreement
• A characterization of eventual Byzantine agreement
• Fast asynchronous Byzantine agreement and leader election with full information
• Distributed consensus in the presence of sectional faults
• Efficient player-optimal protocols for strong and differential consensus
• ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS
• Byzantine Agreement in Expected Polynomial Time
• THE PROPORTIONAL LOTTERY PROTOCOL IS STRONGLY β-PARTICIPATORY AND VNM-STRATEGY-PROOF
• Asynchronous consensus and broadcast protocols
• An O (log n ) expected rounds randomized byzantine generals protocol
• A compiler that increases the fault tolerance of asynchronous protocols
• On Byzantine generals with alternative plans
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• scientific article; zbMATH DE number 1973984 (Why is no real title available?)
• scientific article; zbMATH DE number 1848309 (Why is no real title available?)
• A hybrid protocol to solve authenticated Byzantine consensus
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• Resilient-optimal interactive consistency in constant time
• Fast Byzantine agreement
• Random oracles in constantipole
• Optimally efficient multi-valued byzantine agreement
• Structural Information and Communication Complexity
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• scientific article; zbMATH DE number 7774289 (Why is no real title available?)
• Total ordering algorithms for asynchronous Byzantine systems
• Clairvoyant state machine replications
• Distributed computing in asynchronous networks with byzantine edges
• Expected linear round synchronization: the missing link for linear Byzantine SMR

This page was built for publication: On Optimal Probabilistic Asynchronous Byzantine Agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445740)