On the Round Complexity of Asynchronous Crusader Agreement

Authors Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri



PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2023.29.pdf
  • Filesize: 0.68 MB
  • 21 pages

Document Identifiers

Author Details

Ittai Abraham
  • Intel Labs, Petah Tikva, Israel
Naama Ben-David
  • Technion, Haifa, Israel
Gilad Stern
  • The Hebrew University of Jerusalem, Israel
Sravya Yandamuri
  • Duke University, Durham, NC, USA

Cite AsGet BibTex

Ittai Abraham, Naama Ben-David, Gilad Stern, and Sravya Yandamuri. On the Round Complexity of Asynchronous Crusader Agreement. In 27th International Conference on Principles of Distributed Systems (OPODIS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 286, pp. 29:1-29:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.OPODIS.2023.29

Abstract

We present new lower and upper bounds on the number of communication rounds required for asynchronous Crusader Agreement (CA) and Binding Crusader Agreement (BCA), two primitives that are used for solving binary consensus. We show results for the information theoretic and authenticated settings. In doing so, we present a generic model for proving round complexity lower bounds in the asynchronous setting. In some settings, our attempts to prove lower bounds on round complexity fail. Instead, we show new, tight, rather surprising round complexity upper bounds for Byzantine fault tolerant BCA with and without a PKI setup.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • lower bounds
  • asynchronous protocols
  • round complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Ittai Abraham, Naama Ben-David, and Sravya Yandamuri. Efficient and adaptively secure asynchronous binary agreement via binding crusader agreement. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pages 381-391, 2022. URL: https://doi.org/10.1145/3519270.3538426.
  2. Marcos K Aguilera, Naama Ben-David, Rachid Guerraoui, Virendra J Marathe, Athanasios Xygkis, and Igor Zablotchi. Microsecond consensus for microsecond applications. In Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation, pages 599-616, 2020. URL: https://www.usenix.org/conference/osdi20/presentation/aguilera.
  3. Marcos K Aguilera, Naama Ben-David, Rachid Guerraoui, Antoine Murat, Athanasios Xygkis, and Igor Zablotchi. Ubft: Microsecond-scale bft using disaggregated memory. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2, pages 862-877, 2023. URL: https://doi.org/10.1145/3575693.3575732.
  4. Marcos Kawazoe Aguilera and Sam Toueg. A simple bivalency proof that t-resilient consensus requires t + 1 rounds. Inf. Process. Lett., 71(3-4):155-158, 1999. URL: https://doi.org/10.1016/S0020-0190(99)00100-3.
  5. Hagit Attiya and Jennifer L. Welch. Multi-valued connected consensus: A new perspective on crusader agreement and adopt-commit, 2023. URL: https://arxiv.org/abs/2308.04646.
  6. Michael Ben-Or. Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In Proceedings of the second annual ACM symposium on Principles of distributed computing, pages 27-30, 1983. URL: https://doi.org/10.1145/800221.806707.
  7. Christian Cachin and Luca Zanolini. From symmetric to asymmetric asynchronous byzantine consensus. arXiv preprint, 2020. URL: https://arxiv.org/abs/2005.08795.
  8. Ran Canetti and Tal Rabin. Fast asynchronous byzantine agreement with optimal resilience. In S. Rao Kosaraju, David S. Johnson, and Alok Aggarwal, editors, Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pages 42-51. ACM, 1993. URL: https://doi.org/10.1145/167088.167105.
  9. Tyler Crain. Two more algorithms for randomized signature-free asynchronous binary byzantine consensus with t < n/3 and o (n²) messages and o (1) round expected termination. arXiv preprint, 2020. URL: https://arxiv.org/abs/2002.08765.
  10. Richard A. DeMillo, Nancy A. Lynch, and Michael Merritt. Cryptographic protocols. In Harry R. Lewis, Barbara B. Simons, Walter A. Burkhard, and Lawrence H. Landweber, editors, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA, pages 383-400. ACM, 1982. URL: https://doi.org/10.1145/800070.802214.
  11. Dan Dobre and Neeraj Suri. One-step consensus with zero-degradation. In International Conference on Dependable Systems and Networks (DSN'06), pages 137-146. IEEE, 2006. URL: https://doi.org/10.1109/DSN.2006.55.
  12. Danny Dolev. The byzantine generals strike again. Journal of algorithms, 3(1):14-30, 1982. URL: https://doi.org/10.1016/0196-6774(82)90004-9.
  13. Danny Dolev, Rüdiger Reischuk, and H. Raymond Strong. Early stopping in byzantine agreement. J. ACM, 37(4):720-741, 1990. URL: https://doi.org/10.1145/96559.96565.
  14. Danny Dolev and H. Raymond Strong. Authenticated algorithms for byzantine agreement. SIAM J. Comput., 12(4):656-666, 1983. URL: https://doi.org/10.1137/0212045.
  15. Cynthia Dwork and Yoram Moses. Knowledge and common knowledge in a byzantine environment: Crash failures. Inf. Comput., 88(2):156-186, 1990. URL: https://doi.org/10.1016/0890-5401(90)90014-9.
  16. Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Process. Lett., 14(4):183-186, 1982. URL: https://doi.org/10.1016/0020-0190(82)90033-3.
  17. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, apr 1985. URL: https://doi.org/10.1145/3149.214121.
  18. Seth Gilbert and Nancy A. Lynch. Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2):51-59, 2002. URL: https://doi.org/10.1145/564585.564601.
  19. Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael Reiter, Dragos-Adrian Seredinschi, Orr Tamir, and Alin Tomescu. Sbft: A scalable and decentralized trust infrastructure. In 2019 49th Annual IEEE/IFIP international conference on dependable systems and networks (DSN), pages 568-580. IEEE, 2019. URL: https://doi.org/10.1109/DSN.2019.00063.
  20. Leslie Lamport. Lower bounds on consensus. Unpublished manuscript, 2000. Google Scholar
  21. Leslie Lamport. Fast paxos. Distributed Computing, 19:79-103, 2006. URL: https://doi.org/10.1007/S00446-006-0005-X.
  22. Leslie Lamport. Lower bounds for asynchronous consensus. Distributed Comput., 19(2):104-125, 2006. URL: https://doi.org/10.1007/S00446-006-0155-X.
  23. Nancy Lynch. A hundred impossibility proofs for distributed computing. In Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, pages 1-28, 1989. URL: https://doi.org/10.1145/72981.72982.
  24. Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1996. Google Scholar
  25. Achour Mostéfaoui, Hamouma Moumen, and Michel Raynal. Signature-free asynchronous byzantine consensus with t < n/3 and o(n²) messages. In Proceedings of the 2014 ACM symposium on Principles of distributed computing, pages 2-9, 2014. URL: https://doi.org/10.1145/2611462.2611468.
  26. Adriana Szekeres, Michael Whittaker, Jialin Li, Naveen Kr Sharma, Arvind Krishnamurthy, Dan RK Ports, and Irene Zhang. Meerkat: Multicore-scalable replicated transactions following the zero-coordination principle. In Proceedings of the Fifteenth European Conference on Computer Systems, pages 1-14, 2020. URL: https://doi.org/10.1145/3342195.3387529.
  27. Cheng Wang, Jianyu Jiang, Xusheng Chen, Ning Yi, and Heming Cui. Apus: Fast and scalable paxos on rdma. In Proceedings of the 2017 Symposium on Cloud Computing, pages 94-107, 2017. URL: https://doi.org/10.1145/3127479.3128609.
  28. Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. Hotstuff: Bft consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 347-356, 2019. URL: https://doi.org/10.1145/3293611.3331591.
  29. Irene Zhang, Naveen Kr Sharma, Adriana Szekeres, Arvind Krishnamurthy, and Dan RK Ports. Building consistent transactions with inconsistent replication. ACM Transactions on Computer Systems (TOCS), 35(4):1-37, 2018. URL: https://doi.org/10.1145/3269981.