Document Open Access Logo

Convex Consensus with Asynchronous Fallback

Authors Andrei Constantinescu , Diana Ghinea , Roger Wattenhofer , Floris Westermann

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2024.15.pdf
  • Filesize: 0.97 MB
  • 23 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Cryptographic protocols
Keywords
  • convex consensus
  • network-agnostic protocols
  • agreement on a core-set

Metrics

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

Abstract

Convex Consensus (CC) allows a set of parties to agree on a value v inside the convex hull of their inputs with respect to a predefined abstract convexity notion, even in the presence of byzantine parties. In this work, we focus on achieving CC in the best-of-both-worlds paradigm, i.e., simultaneously tolerating at most t_s corruptions if communication is synchronous, and at most t_a ≤ t_s corruptions if it is asynchronous. Our protocol is randomized, which is a requirement under asynchrony, and we prove that it achieves optimal resilience. In the process, we introduce communication primitives tailored to the network-agnostic model. These are a deterministic primitive allowing parties to obtain intersecting views (Gather), and a randomized primitive leading to identical views (Agreement on a Core-Set). Our primitives provide stronger guarantees than previous counterparts, making them of independent interest.

Cite As Get BibTex

Andrei Constantinescu, Diana Ghinea, Roger Wattenhofer, and Floris Westermann. Convex Consensus with Asynchronous Fallback. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 15:1-15:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.DISC.2024.15

Author Details

Andrei Constantinescu
  • ETH Zürich, Switzerland
Diana Ghinea
  • ETH Zürich, Switzerland
Roger Wattenhofer
  • ETH Zürich, Switzerland
Floris Westermann
  • ETH Zürich, Switzerland

Acknowledgements

We thank Julian Loss and the anonymous reviewers for their useful suggestions.

References

  1. Ittai Abraham, Yonatan Amit, and Danny Dolev. Optimal resilience asynchronous approximate agreement. In Teruo Higashino, editor, Principles of Distributed Systems, pages 229-239, Berlin, Heidelberg, 2005. Springer Berlin Heidelberg. Google Scholar
  2. Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. Reaching consensus for asynchronous distributed key generation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC'21, pages 363-373, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3465084.3467914.
  3. Manuel Alcántara, Armando Castañeda, David Flores-Peñaloza, and Sergio Rajsbaum. The topology of look-compute-move robot wait-free algorithms with hard termination. Distributed Computing, 32(3):235-255, 2019. URL: https://doi.org/10.1007/s00446-018-0345-3.
  4. Andreea B. Alexandru, Erica Blum, Jonathan Katz, and Julian Loss. State machine replication under changing network conditions. In Advances in Cryptology – ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5–9, 2022, Proceedings, Part I, pages 681-710, Berlin, Heidelberg, 2023. Springer-Verlag. URL: https://doi.org/10.1007/978-3-031-22963-3_23.
  5. Dan Alistarh, Faith Ellen, and Joel Rybicki. Wait-free approximate agreement on graphs. In Tomasz Jurdziński and Stefan Schmid, editors, Structural Information and Communication Complexity, pages 87-105, Cham, 2021. Springer International Publishing. URL: https://doi.org/10.1007/978-3-030-79527-6_6.
  6. Ananya Appan, Anirudh Chandramouli, and Ashish Choudhury. Perfectly-secure synchronous mpc with asynchronous fallback guarantees. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, PODC'22, pages 92-102, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519270.3538417.
  7. Michael Ben-Or, Ran Canetti, and Oded Goldreich. Asynchronous secure computation. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC '93, pages 52-61, New York, NY, USA, 1993. Association for Computing Machinery. URL: https://doi.org/10.1145/167088.167109.
  8. Michael Ben-Or, Boaz Kelmer, and Tal Rabin. Asynchronous secure computations with optimal resilience (extended abstract). In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '94, pages 183-192, New York, NY, USA, 1994. Association for Computing Machinery. URL: https://doi.org/10.1145/197917.198088.
  9. Erica Blum, Jonathan Katz, and Julian Loss. Synchronous consensus with optimal asynchronous fallback guarantees. In Theory of Cryptography, volume 11891 of Lecture Notes in Computer Science, pages 131-150, Cham, 2019. Springer International Publishing. URL: https://doi.org/10.1007/978-3-030-36030-6_6.
  10. Erica Blum, Jonathan Katz, and Julian Loss. Tardigrade: An atomic broadcast protocol for arbitrary network conditions. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part II, volume 13091 of LNCS, pages 547-572. Springer, Heidelberg, December 2021. URL: https://doi.org/10.1007/978-3-030-92075-3_19.
  11. Erica Blum, Chen-Da Liu-Zhang, and Julian Loss. Always have a backup plan: Fully secure synchronous mpc with asynchronous fallback. In Daniele Micciancio and Thomas Ristenpart, editors, Advances in Cryptology - CRYPTO 2020, pages 707-731, Cham, 2020. Springer International Publishing. URL: https://doi.org/10.1007/978-3-030-56880-1_25.
  12. Gabriel Bracha. Asynchronous byzantine agreement protocols. Information and Computation, 75(2):130-143, 1987. URL: https://doi.org/10.1016/0890-5401(87)90054-X.
  13. Ran Canetti and Tal Rabin. Fast asynchronous byzantine agreement with optimal resilience. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC '93, pages 42-51, New York, NY, USA, 1993. Association for Computing Machinery. URL: https://doi.org/10.1145/167088.167105.
  14. Armando Castañeda, Sergio Rajsbaum, and Matthieu Roy. Convergence and covering on graphs for wait-free robots. Journal of the Brazilian Computer Society, 24(1):1, January 2018. URL: https://doi.org/10.1186/s13173-017-0065-8.
  15. Giovanni Deligios, Martin Hirt, and Chen-Da Liu-Zhang. Round-efficient byzantine agreement and multi-party computation with asynchronous fallback. In Kobbi Nissim and Brent Waters, editors, Theory of Cryptography, pages 623-653, Cham, 2021. Springer International Publishing. URL: https://doi.org/10.1007/978-3-030-90459-3_21.
  16. Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. J. ACM, 33(3):499-516, May 1986. URL: https://doi.org/10.1145/5925.5931.
  17. Danny Dolev and H. Raymond Strong. Authenticated algorithms for byzantine agreement. SIAM Journal on Computing, 12(4):656-666, 1983. URL: https://doi.org/10.1137/0212045.
  18. Michael J Fischer, Nancy A Lynch, and Michael S Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374-382, 1985. URL: https://doi.org/10.1145/3149.214121.
  19. Matthias Fitzi and Juan A. Garay. Efficient player-optimal protocols for strong and differential consensus. In Elizabeth Borowsky and Sergio Rajsbaum, editors, 22nd ACM PODC, pages 211-220. ACM, July 2003. URL: https://doi.org/10.1145/872035.872066.
  20. Diana Ghinea, Chen-Da Liu-Zhang, and Roger Wattenhofer. Optimal synchronous approximate agreement with asynchronous fallback. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, PODC'22, pages 70-80, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519270.3538442.
  21. Diana Ghinea, Chen-Da Liu-Zhang, and Roger Wattenhofer. Multidimensional approximate agreement with asynchronous fallback. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '23, pages 141-151, New York, NY, USA, 2023. Association for Computing Machinery. URL: https://doi.org/10.1145/3558481.3591105.
  22. Simon Holmgaard Kamp and Jesper Buus Nielsen. Byzantine agreement decomposed: Honest majority asynchronous atomic broadcast from reliable broadcast. Cryptology ePrint Archive, Paper 2023/1738, 2023. URL: https://eprint.iacr.org/2023/1738.
  23. Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982. URL: https://doi.org/10.1145/357172.357176.
  24. Jérémy Ledent. Brief announcement: Variants of approximate agreement on graphs and simplicial complexes. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC'21, pages 427-430, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3465084.3467946.
  25. Christoph Lenzen and Julian Loss. Optimal clock synchronization with signatures. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, PODC'22, pages 440-449, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519270.3538444.
  26. Shihao Liu. The Impossibility of Approximate Agreement on a Larger Class of Graphs. In Eshcar Hillel, Roberto Palmieri, and Etienne Rivière, editors, 26th International Conference on Principles of Distributed Systems (OPODIS 2022), volume 253 of Leibniz International Proceedings in Informatics (LIPIcs), pages 22:1-22:20, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2022.22.
  27. Hammurabi Mendes and Maurice Herlihy. Multidimensional approximate agreement in byzantine asynchronous systems. In Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, 45th ACM STOC, pages 391-400. ACM Press, June 2013. URL: https://doi.org/10.1145/2488608.2488657.
  28. Hammurabi Mendes, Maurice Herlihy, Nitin Vaidya, and Vijay K Garg. Multidimensional agreement in byzantine systems. Distributed Computing, 28(6):423-441, 2015. URL: https://doi.org/10.1007/S00446-014-0240-5.
  29. Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. The honey badger of BFT protocols. In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi, editors, ACM CCS 2016, pages 31-42. ACM Press, October 2016. URL: https://doi.org/10.1145/2976749.2978399.
  30. Atsuki Momose and Ling Ren. Multi-threshold byzantine fault tolerance. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS '21, pages 1686-1699, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3460120.3484554.
  31. Achour Mostefaoui, 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, PODC '14, pages 2-9, New York, NY, USA, 2014. Association for Computing Machinery. URL: https://doi.org/10.1145/2611462.2611468.
  32. Gil Neiger. Distributed consensus revisited. Information Processing Letters, 49(4):195-201, 1994. URL: https://doi.org/10.1016/0020-0190(94)90011-6.
  33. Thomas Nowak and Joel Rybicki. Byzantine Approximate Agreement on Graphs. In Jukka Suomela, editor, 33rd International Symposium on Distributed Computing (DISC 2019), volume 146 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1-29:17, Dagstuhl, Germany, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.DISC.2019.29.
  34. Thomas Nowak and Joel Rybicki. Byzantine approximate agreement on graphs, 2019. URL: https://arxiv.org/abs/1908.02743.
  35. Gerard Sierksma. Caratheodory and helly-numbers of convex-product-structures. Pacific Journal of Mathematics, 61:275-282, 1975. Google Scholar
  36. Lewis Tseng and Nitin H. Vaidya. Asynchronous convex hull consensus in the presence of crash faults. In Magnús M. Halldórsson and Shlomi Dolev, editors, 33rd ACM PODC, pages 396-405. ACM, July 2014. URL: https://doi.org/10.1145/2611462.2611470.
  37. Nitin H. Vaidya and Vijay K. Garg. Byzantine vector consensus in complete graphs. In Panagiota Fatourou and Gadi Taubenfeld, editors, 32nd ACM PODC, pages 65-73. ACM, July 2013. URL: https://doi.org/10.1145/2484239.2484256.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact