Volia: An Efficient and Light Asynchronous BFT Protocol
- 18 June 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 6706-6718
Abstract
Byzantine Fault Tolerance (BFT) protocols can be divided into synchronous BFT protocols, partially synchronous BFT protocols, and asynchronous BFT protocols according to communication delay. Asynchronous BFT protocols are widely used because they can tolerate uncertain communication delays in the real world. However, asynchronous BFT protocols need to perform many rounds of broadcasts to reach agreement on a transaction subset, which consumes a lot of communication, computing, and storage resources. In this paper, we present Volia, an asynchronous BFT protocol which resolves above problem.We design new broadcast protocol to reduce the number of broadcast rounds needed for agreement. It reduces the communication overhead. Voting broadcast is used to maintain the order of transaction subsets rather than threshold signature to reduce computation cost. Above mechanisms speeds up the agreement phase, reduces the accumulated transaction subsets waiting for agreement and thus saves storage resources. We conduct experiment on Volia and the results show that Volia exhibits about 2~65× throughput, 2~25% latency, and 30% storage cost compared to other asynchronous BFT protocols.Keywords
Funding Information
- National Key Research and Development Program of China (2021YFB2700200)
- Key Research and Development Program of Hubei Province under (2024BAB018)
- Key Technology Research and Development Program of Shandong Province (2022CXPT055)
This publication has 22 references indexed in Scilit:
- Red Belly: A Secure, Fair and Scalable Open Blockchain2021
- EPIC: Efficient Asynchronous BFT with Adaptive Security2020
- Computational Security of Quantum Encryption2016
- The Honey Badger of BFT Protocols2016
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience2008
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme2002
- Secure and Efficient Asynchronous Broadcast Protocols2001
- Asynchronous secure computations with optimal resilience (extended abstract)1994
- Asynchronous Byzantine agreement protocolsInformation and Computation, 1987
- Randomized byzantine generals1983