On Optimal Probabilistic Asynchronous Byzantine Agreement

DOI10.1007/978-3-540-77444-0_7zbMath1131.68346OpenAlexW1758224434MaRDI QIDQ5445740

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

fault toleranceDistributed computingByzantine agreement problemcomputationally bounded Byzantine adversary

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Universal classes of hash functions
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Unreliable failure detectors for reliable distributed systems
• Optimally efficient multi-valued byzantine agreement

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