Abstract
The Byzantine Fault Tolerance (BFT) protocol is a long-standing topic. Recently, a lot of efforts have been made in the research of asynchronous BFT. However, the existing solutions cannot adapt well to the flexible network environment, and suffer from problems such as high communication complexity or long latency. To improve the efficiency of BFT consensus in flexible networks, we propose FaBFT. FaBFT’s clients can make their own assumptions about the network conditions, and make the most of their networks based on different network assumptions. We also use the BlockDAG structure and an efficient consistent broadcast protocol to improve the concurrency and reduce the number of steps in FaBFT. The comparison with other asynchronous BFT protocols shows that FaBFT has lower complexity and cancels the dependency on the view change. We prove that FaBFT is an atomic broadcast protocol in flexible networks.
This work was supported in part by the Key Research and Development Plan of Shandong Province (No. 2021CXGC010105).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Byzantine broadcasts and randomized consensus (2009). https://dcl.epfl.ch/site/education/secure_distributed_computing
Cachin, C., Shoup, V.: Random oracles in constantinople: practical asynchronous byzantine agreement using. In: Proceedings of the 19th ACM Symposium on Principles of Distributed Computing, pp. 1–26 (2000)
Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 42–51 (1993)
Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OSDI, vol. 99, pp. 173–186 (1999)
Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Narwhal and tusk: a DAG-based mempool and efficient BFT consensus. In: Proceedings of the Seventeenth European Conference on Computer Systems, pp. 34–50 (2022)
Duan, S., et al.: Dashing and star: byzantine fault tolerance using weak certificates. Cryptology ePrint Archive (2022)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374–382 (1985)
Gągol, A., Leśniak, D., Straszak, D., Świętek, M.: Aleph: efficient atomic broadcast in asynchronous networks with byzantine nodes. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, pp. 214–228 (2019)
Gelashvili, R., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A., Xiang, Z.: Jolteon and ditto: network-adaptive efficient consensus with asynchronous fallback. In: Eyal, I., Garay, J. (eds.) FC 2022. LNCS, vol. 13411, pp. 296–315. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-18283-9_14
Guo, B., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Speeding dumbo: pushing asynchronous BFT closer to practice. Cryptology ePrint Archive (2022)
Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: faster asynchronous BFT protocols. In: 2020 ACM CCS, pp. 803–818 (2020)
Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is DAG. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 165–175 (2021)
Lu, Y., Lu, Z., Tang, Q.: Bolt-dumbo transformer: asynchronous consensus as fast as the pipelined BFT. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 2159–2173 (2022)
Malkhi, D., Nayak, K., Ren, L.: Flexible byzantine fault tolerance. In: Proceedings of the 2019 ACM SIGSAC Conference on CCS, pp. 1041–1053 (2019)
Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: 2016 ACM CCS, pp. 31–42 (2016)
Neu, J., Tas, E.N., Tse, D.: EBB-and-flow protocols: a resolution of the availability-finality dilemma. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 446–465. IEEE (2021)
Song, Y., Long, Y., Xu, X., Gu, D.: FaBFT: flexible asynchronous BFT protocol using DAG. Cryptology ePrint Archive (2023)
Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: DAG BFT protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 2705–2718 (2022)
Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347–356 (2019)
Zhang, H., Duan, S.: Pace: fully parallelizable BFT from reproposable byzantine agreement. Cryptology ePrint Archive (2022)
Zhou, Y., et al.: Dory: asynchronous BFT with reduced communication and improved efficiency. Cryptology ePrint Archive (2022)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Song, Y., Long, Y., Xu, X., Gu, D. (2024). FaBFT: Flexible Asynchronous BFT Protocol Using DAG. In: Ge, C., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2023. Lecture Notes in Computer Science, vol 14527. Springer, Singapore. https://doi.org/10.1007/978-981-97-0945-8_20
Download citation
DOI: https://doi.org/10.1007/978-981-97-0945-8_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-0944-1
Online ISBN: 978-981-97-0945-8
eBook Packages: Computer ScienceComputer Science (R0)