Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hamster: A Fast Synchronous Byzantine Fault Tolerance Protocol

Published 29 Sep 2024 in cs.DC | (2409.19564v1)

Abstract: This paper introduces Hamster, a novel synchronous Byzantine Fault Tolerance protocol that achieves better performance and has weaker dependency on synchrony. Specifically, Hamster employs coding techniques to significantly decrease communication complexity and addresses coding related security issues. Consequently, Hamster achieves a throughput gain that increases linearly with the number of nodes, compared to Sync HotStuff. By adjusting the block size, Hamster outperforms Sync HotStuff in terms of both throughput and latency. Moreover, With minor modifications, Hamster can also function effectively in mobile sluggish environments, further reducing its dependency on strict synchrony. We implement Hamster and the experimental results demonstrate its performance advantages. Specifically, Hamster's throughput in a network of $9$ nodes is $2.5\times$ that of Sync HotStuff, and this gain increases to $10$ as the network scales to $65$ nodes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. L. Lamport, R. E. Shostak, and M. C. Pease, “The Byzantine Generals Problem,” ACM Trans. Program. Lang. Syst., vol. 4, no. 3, pp. 382–401, 1982.
  2. M. Fitzi, “Generalized communication and security models in byzantine agreement,” Ph.D. dissertation, ETH Zurich, 2002.
  3. C. Dwork, N. A. Lynch, and L. J. Stockmeyer, “Consensus in the presence of partial synchrony,” J. ACM, vol. 35, no. 2, pp. 288–323, 1988.
  4. T. Hanke, M. Movahedi, and D. Williams, “Dfinity technology overview series, consensus system,” arXiv preprint arXiv:1805.04548, 2018.
  5. I. Abraham, D. Malkhi, K. Nayak, L. Ren, and M. Yin, “Sync hotstuff: Simple and practical synchronous state machine replication,” in 2020 IEEE Symposium on Security and Privacy, SP 2020, San Francisco, CA, USA, May 18-21, 2020.   IEEE, 2020, pp. 106–118.
  6. M. Yin, D. Malkhi, M. K. Reiter, G. Golan-Gueta, and I. Abraham, “Hotstuff: BFT consensus with linearity and responsiveness,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, P. Robinson and F. Ellen, Eds.   ACM, 2019, pp. 347–356.
  7. X. Sui, S. Duan, and H. Zhang, “Marlin: Two-phase bft with linearity,” in 2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).   IEEE, 2022, pp. 54–66.
  8. Y. Guo, R. Pass, and E. Shi, “Synchronous, with a chance of partition tolerance,” in Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I, ser. Lecture Notes in Computer Science, A. Boldyreva and D. Micciancio, Eds., vol. 11692.   Springer, 2019, pp. 499–529.
  9. F. Gai, A. Farahbakhsh, J. Niu, C. Feng, I. Beschastnikh, and H. Duan, “Dissecting the performance of chained-bft,” in 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS).   IEEE, 2021, pp. 595–606.
  10. I. Reed and G. Solomon, “Polynomial codes over certain finite fields,” Journal of the Society for Industrial and Applied Mathematics, vol. 8, pp. 300–304, Jun. 1960.
  11. Intel, “Intel(R) Intelligent Storage Acceleration Library,” 2020. [Online]. Available: https://github.com/intel/isa-l
  12. N. Alhaddad, S. Das, S. Duan, L. Ren, M. Varia, Z. Xiang, and H. Zhang, “Balanced byzantine reliable broadcast with near-optimal communication and improved computation,” in Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, 2022, pp. 399–417.
  13. S. Das, Z. Xiang, and L. Ren, “Asynchronous data dissemination and its applications,” in CCS ’21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021, Y. Kim, J. Kim, G. Vigna, and E. Shi, Eds.   ACM, 2021, pp. 2705–2721.
  14. C. Cachin and S. Tessaro, “Asynchronous verifiable information dispersal,” in Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings, ser. Lecture Notes in Computer Science, P. Fraigniaud, Ed., vol. 3724.   Springer, 2005, pp. 503–504.
  15. A. Miller, Y. Xia, K. Croman, E. Shi, and D. Song, “The honey badger of bft protocols,” in Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, 2016, pp. 31–42.
  16. N. Alhaddad, S. Duan, M. Varia, and H. Zhang, “Practical and improved byzantine reliable broadcast and asynchronous verifiable information dispersal from hash functions,” IACR Cryptol. ePrint Arch., p. 171, 2022.
  17. L. Yang, S. J. Park, M. Alizadeh, S. Kannan, and D. Tse, “Dispersedledger: High-throughput byzantine consensus on variable bandwidth networks,” in 19th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2022, Renton, WA, USA, April 4-6, 2022, A. Phanishayee and V. Sekar, Eds.   USENIX Association, 2022, pp. 493–512.
  18. N. Alhaddad, S. Das, S. Duan, L. Ren, M. Varia, Z. Xiang, and H. Zhang, “Brief announcement: Asynchronous verifiable information dispersal with near-optimal communication,” in PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, A. Milani and P. Woelfel, Eds.   ACM, 2022, pp. 418–420.
  19. I. Kaklamanis, L. Yang, and M. Alizadeh, “Poster: Coded broadcast for scalable leader-based bft consensus,” in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, pp. 3375–3377.
  20. P. C. Kocher, “On certificate revocation and validation,” in International conference on financial cryptography.   Springer, 1998, pp. 172–177.
  21. M. Castro and B. Liskov, “Practical byzantine fault tolerance,” in Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, February 22-25, 1999, M. I. Seltzer and P. J. Leach, Eds.   USENIX Association, 1999, pp. 173–186.
  22. G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “Keccak,” in Annual international conference on the theory and applications of cryptographic techniques.   Springer, 2013, pp. 313–314.
  23. J. Kim, V. Mehta, K. Nayak, and N. Shrestha, “Brief announcement: Making synchronous bft protocols secure in the presence of mobile sluggish faults,” in Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 2021, pp. 375–377.
  24. R. Pass and E. Shi, “Thunderella: Blockchains with optimistic instant confirmation,” in Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29-May 3, 2018 Proceedings, Part II 37.   Springer, 2018, pp. 3–33.
  25. I. Abraham, K. Nayak, and N. Shrestha, “Optimal good-case latency for rotating leader synchronous bft,” Cryptology ePrint Archive, 2021.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up