Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Efficient Signature-Free Validated Agreement (2403.08374v3)

Published 13 Mar 2024 in cs.DC

Abstract: Byzantine agreement enables n processes to agree on a common L-bit value, despite up to t > 0 arbitrary failures. A long line of work has been dedicated to improving the bit complexity of Byzantine agreement in synchrony. This has culminated in COOL, an error-free (deterministically secure against a computationally unbounded adversary) solution that achieves O(nL + n2 logn) worst-case bit complexity (which is optimal for L >= n logn according to the Dolev-Reischuk lower bound). COOL satisfies strong unanimity: if all correct processes propose the same value, only that value can be decided. Strong unanimity is, however, not sufficient for today's state machine replication (SMR) and blockchain protocols. These systems value progress and require a decided value to always be valid, excluding default decisions (such as EMPTY) even in cases where there is no unanimity a priori. Validated Byzantine agreement satisfies this property (called external validity). Yet, the best error-free (or even signature-free) validated agreement solutions achieve only O(n2L) bit complexity, a far cry from the Omega(nL + n2) Dolev-Reishcuk lower bound. In this paper, we present two new synchronous algorithms for validated Byzantine agreement, HashExt and ErrorFreeExt, with different trade-offs. Both algorithms are (1) signature-free, (2) optimally resilient (tolerate up to t < n / 3 failures), and (3) early-stopping (terminate in O(f+1) rounds, where f <= t is the actual number of failures). On the one hand, HashExt uses only hashes and achieves O(nL + n3 kappa) bit complexity, which is optimal for L >= n2 kappa (where kappa is the size of a hash). On the other hand, ErrorFreeExt is error-free, using no cryptography whatsoever, and achieves O( (nL + n2) logn ) bit complexity, which is near-optimal for any L.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (71)
  1. Fault-Scalable Byzantine Fault-Tolerant Services. ACM SIGOPS Operating Systems Review, 39(5):59–74, 2005.
  2. Gradecast in synchrony and reliable broadcast in asynchrony with optimal resilience, efficiency, and unconditional security. In Alessia Milani and Philipp Woelfel, editors, PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pages 392–398. ACM, 2022. doi:10.1145/3519270.3538451.
  3. Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. In Alessia Milani and Philipp Woelfel, editors, PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pages 381–391. ACM, 2022. doi:10.1145/3519270.3538426.
  4. Communication Complexity of Byzantine Agreement, Revisited. In Peter Robinson and Faith Ellen, editors, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, pages 317–326. ACM, 2019.
  5. Communication complexity of byzantine agreement, revisited. Distributed Comput., 36(1):3–28, 2023. URL: https://doi.org/10.1007/s00446-022-00428-8, doi:10.1007/S00446-022-00428-8.
  6. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. arXiv preprint arXiv:1612.02916, 2016.
  7. Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus. CoRR, abs/1612.02916, 2016.
  8. New dolev-reischuk lower bounds meet blockchain eclipse attacks. In Eshcar Hillel, Roberto Palmieri, and Etienne Rivière, editors, 26th International Conference on Principles of Distributed Systems, OPODIS 2022, December 13-15, 2022, Brussels, Belgium, volume 253 of LIPIcs, pages 16:1–16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2022.16, doi:10.4230/LIPICS.OPODIS.2022.16.
  9. {{\{{FARSITE}}\}}: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In 5th Symposium on Operating Systems Design and Implementation (OSDI 02), 2002.
  10. Succinct Erasure Coding Proof Systems. Cryptology ePrint Archive, 2021.
  11. Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks. In International Conference on Dependable Systems and Networks (DSN’06), pages 105–114. IEEE, 2006.
  12. Multi-valued connected consensus: A new perspective on crusader agreement and adopt-commit. In Alysson Bessani, Xavier Défago, Junya Nakamura, Koichi Wada, and Yukiko Yamauchi, editors, 27th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6-8, 2023, Tokyo, Japan, volume 286 of LIPIcs, pages 6:1–6:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2023.6, doi:10.4230/LIPICS.OPODIS.2023.6.
  13. Simple and efficient perfectly-secure asynchronous MPC. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4833 LNCS:376–392, 2007. doi:10.1007/978-3-540-76900-2_23.
  14. Asynchronous Secure Computation. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 52–61, 1993.
  15. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In Janos Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pages 1–10. ACM, 1988. doi:10.1145/62212.62213.
  16. Bit Optimal Distributed Consensus. In Computer science: research and applications, pages 313–321. Springer, 1992.
  17. Richard E Blahut. Theory and practice of error control codes, volume 126. Addison-Wesley Reading, 1983.
  18. Fast byzantine agreement. In Proceedings of the 2013 ACM symposium on Principles of distributed computing, pages 57–64, 2013.
  19. Ethan Buchman. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. PhD thesis, University of Guelph, 2016.
  20. Secure and Efficient Asynchronous Broadcast Protocols. In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings, volume 2139 of Lecture Notes in Computer Science, pages 524–541. Springer, 2001. doi:10.1007/3-540-44647-8_31.
  21. Internet Computer Consensus. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 2021:81–91, 2022. doi:10.1145/3519270.3538430.
  22. Practical Byzantine Fault Tolerance and Proactive Recovery. ACM Transactions on Computer Systems, 20(4), 2002.
  23. The hidden graph model: Communication locality and optimal resiliency with adaptive faults. In ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science, pages 153–162, 2015. doi:10.1145/2688073.2688102.
  24. Jinyuan Chen. Fundamental limits of byzantine agreement. CoRR, abs/2009.10965, 2020. URL: https://arxiv.org/abs/2009.10965, arXiv:2009.10965.
  25. Jinyuan Chen. Optimal error-free multi-valued byzantine agreement. In Seth Gilbert, editor, 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), volume 209 of LIPIcs, pages 17:1–17:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. doi:10.4230/LIPIcs.DISC.2021.17.
  26. Ashish Choudhury. Almost-surely terminating asynchronous byzantine agreement against general adversaries with optimal resilience. In 24th International Conference on Distributed Computing and Networking, ICDCN 2023, Kharagpur, India, January 4-7, 2023, pages 167–176. ACM, 2023. doi:10.1145/3571306.3571333.
  27. Dare to agree: Byzantine agreement with optimal resilience and adaptive communication. Cryptology ePrint Archive, Paper 2024/403, 2024. https://eprint.iacr.org/2024/403. URL: https://eprint.iacr.org/2024/403.
  28. Every Bit Counts in Consensus. In Rotem Oshman, editor, 37th International Symposium on Distributed Computing (DISC 2023), volume 281 of Leibniz International Proceedings in Informatics (LIPIcs), pages 13:1–13:26, Dagstuhl, Germany, 2023. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.13, doi:10.4230/LIPIcs.DISC.2023.13.
  29. Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity. Inf. Comput., 97(1):61–85, 1992. doi:10.1016/0890-5401(92)90004-Y.
  30. Miguel Correia. From Byzantine Consensus to Blockchain Consensus. In Essentials of Blockchain Technology, pages 41–80. Chapman and Hall/CRC, 2019.
  31. DBFT: Efficient Leaderless Byzantine Consensus and its Applications to Blockchains. In Proceedings of the 17th IEEE International Symposium on Network Computing and Applications (NCA’18). IEEE, 2018.
  32. Spurt: Scalable distributed randomness beacon with transparent setup. In 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, pages 2502–2517. IEEE, 2022. doi:10.1109/SP46214.2022.9833580.
  33. Asynchronous Data Dissemination and its Applications. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pages 2705–2721, 2021.
  34. On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systems. Journal of Parallel and Distributed Computing, 153:110–118, 2021.
  35. Bounds on information exchange for Byzantine agreement. Journal of the ACM (JACM), 1985.
  36. Bounds on Information Exchange for Byzantine Agreement. Journal of the ACM (JACM), 32(1):191–204, 1985.
  37. Authenticated Algorithms for Byzantine Agreement. SIAM Journal on Computing, 12(4):656–666, 1983.
  38. Foundations of Dynamic BFT. Proceedings - IEEE Symposium on Security and Privacy, 2022-May:1317–1334, 2022. doi:10.1109/SP46214.2022.9833787.
  39. Optimal algorithms for byzantine agreement. In Janos Simon, editor, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pages 148–161. ACM, 1988. doi:10.1145/62212.62225.
  40. A Lower Bound for the Time to Assure Interactive Consistency. Technical report, GEORGIA INST OF TECH ATLANTA SCHOOL OF INFORMATION AND COMPUTER SCIENCE, 1981.
  41. Easy Impossibility Proofs for Distributed Consensus Problems. In Michael A. Malcolm and H. Raymond Strong, editors, Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada, August 5-7, 1985, pages 59–70. ACM, 1985. doi:10.1145/323596.323602.
  42. ALEPH: Efficient atomic broadcast in asynchronous networks with Byzantine nodes. AFT 2019 - Proceedings of the 1st ACM Conference on Advances in Financial Technologies, pages 214–228, 2019. arXiv:1908.05156, doi:10.1145/3318041.3355467.
  43. The Broadcast Message Complexity of Secure Multiparty Computation Sanjam. In Advances in Cryptology (ASIACRYPT), volume 1, pages 426–455, Kobe, Japan, 2019.
  44. Optimal Load-Balanced Scalable Distributed Agreement. In STOC ’24: 56th Annual ACM SIGACT Symposium on Theory of Computing, 2023.
  45. Algorand: Scaling Byzantine Agreements for Cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles, SOSP ’17, page 51–68, New York, NY, USA, 2017. Association for Computing Machinery. doi:10.1145/3132747.3132757.
  46. Shafi Goldwasser. How to Play Any Mental Game, or a Completeness Theorem for Protocols with an Honest Majority. Proc. the Nineteenth Annual ACM STOC’87, pages 218–229, 1987.
  47. Verifying distributed erasure-coded data. In Indranil Gupta and Roger Wattenhofer, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pages 139–146. ACM, 2007. doi:10.1145/1281100.1281122.
  48. All you need is DAG. In Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen, editors, PODC ’21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, pages 165–175. ACM, 2021. doi:10.1145/3465084.3467905.
  49. MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. In 4th Conference on Information-Theoretic Cryptography (ITC), volume 267, pages 1–21, Aarhus, Denmark, 2023. doi:10.4230/LIPIcs.ITC.2023.11.
  50. From almost everywhere to everywhere: Byzantine agreement with Õ (n3/2) bits. In Distributed Computing, 23rd International Symposium (DISC), volume 5805 LNCS, pages 464–478, 2009. doi:10.1007/978-3-642-04355-0_47.
  51. Scalable leader election. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 990–999, 2006. doi:10.1145/1109557.1109667.
  52. Zyzzyva: Speculative Byzantine Fault Tolerance. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, pages 45–58, 2007.
  53. High Throughput Byzantine Fault Tolerance. In International Conference on Dependable Systems and Networks, 2004, pages 575–584. IEEE, 2004.
  54. The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst., 4(3):382–401, 1982.
  55. Concurrency: The works of leslie lamport. Association for Computing Machinery, pages 203–226, 2019.
  56. A recursive early-stopping phase king protocol. In Alessia Milani and Philipp Woelfel, editors, PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pages 60–69. ACM, 2022. doi:10.1145/3519270.3538425.
  57. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited. In Yuval Emek and Christian Cachin, editors, PODC ’20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pages 129–138. ACM, 2020. doi:10.1145/3382734.3405707.
  58. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pages 129–138, 2020.
  59. SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains. Cryptology ePrint Archive, 2015.
  60. Flexible Byzantine Fault Tolerance. In Proceedings of the 2019 ACM SIGSAC conference on computer and communications security, pages 1041–1053, 2019.
  61. Multi-Threshold Byzantine Fault Tolerance. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pages 1686–1699, 2021.
  62. Optimal Communication Complexity of Authenticated Byzantine Agreement. In Seth Gilbert, editor, 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), volume 209 of LIPIcs, pages 32:1–32:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. doi:10.4230/LIPIcs.DISC.2021.32.
  63. Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time. J. ACM, 62(4):31:1–31:21, 2015. doi:10.1145/2785953.
  64. Improved extension protocols for byzantine broadcast and agreement. In Hagit Attiya, editor, 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference, volume 179 of LIPIcs, pages 28:1–28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. doi:10.4230/LIPIcs.DISC.2020.28.
  65. Reaching agreement in the presence of faults. J. ACM, 27(2):228–234, 1980. doi:10.1145/322186.322188.
  66. Linear View Change in Optimistically Fast BFT. In Proceedings of the 2022 ACM Workshop on Developments in Consensus, pages 67–78, 2022.
  67. Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics, 8(2):300–304, 1960.
  68. Lightweight asynchronous verifiable secret sharing with optimal resilience. Cryptology ePrint Archive, 2023.
  69. Alexander Spiegelman. In search for an optimal authenticated byzantine agreement. arXiv preprint arXiv:2002.06993, 2020.
  70. Efficient Byzantine Fault-Tolerance. IEEE Transactions on Computers, 62(1):16–30, 2011.
  71. hbacss: How to robustly share many secrets. In 29th Annual Network and Distributed System Security Symposium, NDSS 2022, San Diego, California, USA, April 24-28, 2022. The Internet Society, 2022. URL: https://www.ndss-symposium.org/ndss-paper/auto-draft-245/.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now