Document Open Access Logo

A Modular Approach to Construct Signature-Free BRB Algorithms Under a Message Adversary

Authors Timothé Albouy, Davide Frey, Michel Raynal, François Taïani

PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2022.26.pdf
  • Filesize: 1.13 MB
  • 23 pages

Document Identifiers

Author Details

Timothé Albouy
  • Univ Rennes, Inria, CNRS, IRISA, France
Davide Frey
  • Univ Rennes, Inria, CNRS, IRISA, France
Michel Raynal
  • Univ Rennes, Inria, CNRS, IRISA, France
François Taïani
  • Univ Rennes, Inria, CNRS, IRISA, France

Funding

This work has been partially supported by the French ANR projects ByBloS (ANR-20-CE25-0002-01) and PriCLeSS (ANR-10-LABX-07-81) devoted to the design of modular distributed computing building blocks.

Cite AsGet BibTex

Timothé Albouy, Davide Frey, Michel Raynal, and François Taïani. A Modular Approach to Construct Signature-Free BRB Algorithms Under a Message Adversary. In 26th International Conference on Principles of Distributed Systems (OPODIS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 253, pp. 26:1-26:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.OPODIS.2022.26

Abstract

This paper explores how reliable broadcast can be implemented without signatures when facing a dual adversary that can both corrupt processes and remove messages. More precisely, we consider an asynchronous n-process message-passing system in which up to t processes are Byzantine and where, at the network level, for each message broadcast by a correct process, an adversary can prevent up to d processes from receiving it (the integer d defines the power of the message adversary). So, unlike previous works, this work considers that not only can computing entities be faulty (Byzantine processes), but, in addition, that the network can also lose messages. To this end, the paper adopts a modular strategy and first introduces a new basic communication abstraction denoted k2𝓁-cast, which simplifies quorum engineering, and studies its properties in this new adversarial context. Then, the paper deconstructs existing signature-free Byzantine-tolerant asynchronous broadcast algorithms and, with the help of the k2𝓁-cast communication abstraction, reconstructs versions of them that tolerate both Byzantine processes and message adversaries. Interestingly, these reconstructed algorithms are also more efficient than the Byzantine-tolerant-only algorithms from which they originate.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Asynchronous system
  • Byzantine processes
  • Communication abstraction
  • Delivery predicate
  • Fault-Tolerance
  • Forwarding predicate
  • Message adversary
  • Message loss
  • Modularity
  • Quorum
  • Reliable broadcast
  • Signature-free algorithm
  • Two-phase commit

Metrics

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

Related Versions

References

  1. I. Abraham, K. Nayak, L. Ren, and Z. Xiang. Good-case latency of Byzantine broadcast: a complete categorization. In Proc. 40th ACM Symposium on Principles of Distributed Computing (PODC'21), pages 331-341. ACM Press, 2021. Google Scholar
  2. I. Abraham, L. Ren, and Z. Xiang. Good-case and bad-case latency of unauthenticated Byzantine broadcast: A complete categorization. In Proc. 25th Int'l Conference on Principles of Distributed Systems (OPODIS'21), pages 5:1-5:20. LIPIcs, 2021. Google Scholar
  3. Y. Afek and E. Gafni. Asynchrony from synchrony. In Proc. 14th Int'l Conference on Distributed Computing and Networking (ICDCN'13), pages 225-239. Springer, 2021. Google Scholar
  4. T. Albouy, D. Frey, M. Raynal, and F. Taïani. Byzantine-tolerant reliable broadcast in the presence of silent churn. In Proc. 23th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'21), pages 21-33. Springer, 2021. Extended version: URL: https://arxiv.org/abs/2205.09992.
  5. T. Albouy, D. Frey, M. Raynal, and F. Taïani. A modular approach to construct signature-free BRB algorithms under a message adversary, 2022. URL: http://arxiv.org/abs/2204.13388.
  6. K. Altisen, S. Devismes, S. Dubois, and F. Petit. Introduction to distributed self-stabilizing algorithms. Morgan & Claypool, 2019. Google Scholar
  7. H. Attiya and J. Welch. Distributed computing: fundamentals, simulations and advanced topics. Wiley-Interscience, 2004. Google Scholar
  8. A. Auvolat, D. Frey, M. Raynal, and F. Taïani. Money transfer made simple: a specification, a generic algorithm, and its proof. Bulletin of EATCS (European Association of Theoretical Computer Science), 132:22-43, 2020. Google Scholar
  9. A. Auvolat, M. Raynal, and F. Taïani. Byzantine-tolerant set-constrained delivery broadcast. In Proc. 23rd Int'l Conference on Principles of Distributed Systems (OPODIS'19), pages 6:1-6:23. LIPIcs, 2019. Google Scholar
  10. M. Baudet, G. Danezis, and A. Sonnino. Fastpay: high-performance Byzantine fault tolerant settlement. In Proc. 2nd ACM Conference on Advances in Financial Technologies (AFT'20), pages 163-177. ACM Press, 2020. Google Scholar
  11. G. Bracha. Asynchronous Byzantine agreement protocols. Information & Computation, 75(2):130-143, 1987. Google Scholar
  12. C. Cachin, R. Guerraoui, and L. Rodrigues. Reliable and secure distributed programming. Springer, 2011. Google Scholar
  13. B. Charron-Bost and A. Schiper. The heard-of model: computing in distributed systems with benign faults. Distributed Computing, 22(1):49-71, 2009. Google Scholar
  14. X. Chen, H. Song, J. Jiang, C. Ruan, C. Li, S. Wang, G. Zhang, R. Cheng, and H. Cui. Achieving low tail-latency and high scalability for serializable transactions in edge computing. In Proc. 16th European Conference on Computer Systems (EuroSys'21), pages 210-227. ACM Press, 2021. Google Scholar
  15. D. Didona and W. Zwaenepoel. Size-aware sharding for improving tail latencies in in-memory key-value stores. In Proc. 16th USENIX Symposium on Networked Systems Design and Implementation (NSDI'19), pages 79-94. USENIX Association, 2019. Google Scholar
  16. D. Dolev. The Byzantine generals strike again. Journal of Algorithms, 3:14-20, 1982. Google Scholar
  17. C. Dwork, D. Peleg, N. Pippenger, and E. Upfal. Fault tolerance in networks of bounded degree. SIAM Journal of Computing, 17(5):975-988, 1988. Google Scholar
  18. R. Guerraoui, J. Komatovic, P. Kuznetsov, Y.A. Pignolet, D.A. Seredinschi, and A. Tonkikh. Dynamic Byzantine reliable broadcast. In Proc. 24th Int'l Conference on Principles of Distributed Systems (OPODIS'20), pages 23:1-23:18. LIPIcs, 2020. Google Scholar
  19. R. Guerraoui, P. Kuznetsov, M. Monti, M. Pavlovic, and D.A. Seredinschi. The consensus number of a cryptocurrency. In Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC’19), pages 307-316. ACM Press, 2019. Google Scholar
  20. D. Imbs and M. Raynal. Trading t-resilience for efficiency in asynchronous Byzantine reliable broadcast. Parallel Processing Letters, 26(4):1650017:1-1650017:8, 2016. Google Scholar
  21. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982. Google Scholar
  22. D. Malkhi and M.K. Reiter. Byzantine quorum systems. Distributed Computing, 11(4):203-213, 1998. Google Scholar
  23. A. Maurer, X. Défago, and S. Tixeuil. Communicating reliably in multi-hop dynamic networks despite Byzantine failures. In Proc. 34th Symposium on Reliable Distributed Systems (SRDS'15), pages 238-245. IEEE Press, 2015. Google Scholar
  24. A. Mostéfaoui, H. Moumen, and M. Raynal. Signature-free asynchronous byzantine consensus with t < n/3 and O(n²) messages. In Proc. 33th ACM Symposium on Principles of Distributed Computing (PODC'14), pages 2-9. ACM Press, 2014. Google Scholar
  25. K. Nayak, L. Ren, E. Shi, N.H. Vaidya, and Z. Xiang. Improved extension protocols for Byzantine broadcast and agreement. In Proc. 34rd Int'l Symposium on Distributed Computing (DISC'20), pages 28:1-28:17. LIPIcs, 2020. Google Scholar
  26. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27:228-234, 1980. Google Scholar
  27. M. Raynal. Distributed algorithms for message-passing systems. Springer, 2013. Google Scholar
  28. M. Raynal. Message adversaries. In Encyclopedia of Algorithms, pages 1272-1276. Springer, 2016. Google Scholar
  29. M. Raynal. Fault-tolerant message-passing distributed systems: an algorithmic approach. Springer, 2018. Google Scholar
  30. M. Raynal and J. Stainer. Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. In Proc. 32nd ACM Symposium on Principles of Distributed Computing (PODC'13), pages 166-175. ACM Press, 2013. Google Scholar
  31. N. Santoro and P. Widmayer. Time is not a healer. In Proc. 6th Annual Symposium on Theoretical Aspects of Computer Science (STACS'89), pages 304-316. Springer, 1989. Google Scholar
  32. N. Santoro and P. Widmayer. Agreement in synchronous networks with ubiquitous faults. Theoretical Computer Science, 384(2-3):232-249, 2007. Google Scholar
  33. L. Tseng, Q. Zhang, S. Kumar, and Y. Zhang. Exact consensus under global asymmetric Byzantine links. In Proc. 40th IEEE Int'l Conference on Distributed Computing Systems (ICDCS 2020), pages 721-731. IEEE Press, 2020. Google Scholar
  34. L. Yang, S.J. Park, M. Alizadeh, S. Kannan, and D. Tse. DispersedLedger: high-throughput Byzantine consensus on variable bandwidth networks. In Prof. 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI'22), pages 493-512. USENIX Association, 2022. Google Scholar
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-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact