Probabilistic Byzantine Fault Tolerance-Reference-Cited by-同舟云学术

Probabilistic Byzantine Fault Tolerance

Published:2024-06-17 Issue: Volume:2 Page:170-181
ISSN:
Container-title:Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Avelas Diogo¹^ORCID,Heydari Hasan¹^ORCID,Alchieri Eduardo²^ORCID,Distler Tobias³^ORCID,Bessani Alysson¹^ORCID

Affiliation:

1. LASIGE, Faculdade de Ciencias, Universidade de Lisboa, Lisbon, Portugal

2. Universidade de Brasilia, Brasília, Brazil

3. Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany

Funder

Deutsche Forschungsgemeinschaft (DFG, German Re- search Foundation)

Publisher

ACM

Reference56 articles.

1. Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2021. Good-case Latency of Byzantine Broadcast: a Complete Categorization. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC '21).

2. Amitanand Aiyer, Lorenzo Alvisi, and Rida A. Bazzi. 2005. On the Availability of Non-strict Quorum Systems. In Proceedings of th 19th International Symposium on Distributed Computing (DISC '05).

3. Diogo Avelãs Hasan Heydari Eduardo Alchieri Tobias Distler and Alysson Bessani. 2024. Probabilistic Byzantine Fault Tolerance (Extended Version). arXiv:2405.04606 [cs.DC]

4. Michael Ben-Or. 1983. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In Proceedings of the 2nd Symposium on Principles of Distributed Computing (PODC '83).

5. Alysson Bessani, Eduardo Alchieri, João Sousa, André Oliveira, and Fernando Pedone. 2020. From Byzantine Replication to Blockchain: Consensus is only the Beginning. In Proceedings of the 50th IEEE/IFIP Int. Conference on Dependable Systems and Networks (DSN '20).